import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

package dancinggooglers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;

public class DancingGooglers {

    public static void main(String[] args) {

        String input;
        String output = "";
        int i = 0, googler, div, under, valid, remains;
        int cases, surp, point;
                
        try {  
            FileReader fr = new FileReader(new File("B-large.in"));  
            BufferedReader br = new BufferedReader(fr);
            
            FileWriter fstream = new FileWriter("B-large.out");
            BufferedWriter out = new BufferedWriter(fstream);

            cases = Integer.parseInt(br.readLine());
            i = 0;

            while(i < cases) {
                input = br.readLine();
                output += "Case #"+(++i)+": "; 
                String[] split = input.split(" ");
                
                surp = Integer.parseInt(split[1]);
                point = Integer.parseInt(split[2]);
                under = 0;
                valid =0;

                for (int j=0; j<Integer.parseInt(split[0]); j++){
                    
                    googler = Integer.parseInt(split[3+j]);
                    div = googler - point*3;
                    remains = googler - point;

                    if((div > -3)&&(remains >= 0)){ valid++; }
                    
                    else if((div > -5)&&(remains >= 0)){ under++; }   
                }
                
                if(under <= surp) { valid += under; }
                else { valid += surp; }

                output += valid;

                out.write(output);
                output = "\n";
            }

            out.close();
            br.close();
            
        }catch (Exception e) { System.err.println("Error: " + e.getMessage()); }
        
    }
}
