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 problemB;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;



public class DancingwithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
		FileWriter fw = new FileWriter("B-large.out");
		/*BufferedReader in = new BufferedReader(new FileReader("A-large-practice.in"));
		FileWriter fw = new FileWriter("A-large-practice.out");*/
		int T = new Integer(in.readLine());
		for (int cases = 1; cases <= T; cases++){
			StringTokenizer st=new StringTokenizer(in.readLine());
			int numG = new Integer(st.nextToken());
			int numTriplets = new Integer(st.nextToken());
			int leastP = new Integer(st.nextToken());
			Integer[] A = new Integer[numG];
			for (int i = 0; i < A.length; i++){
				A[i] = new Integer(st.nextToken());
			}
			Arrays.sort(A, Collections.reverseOrder());
			int result = 0;
			for (int i = 0; i < A.length; i++){
				if (A[i] >= 2){
					if (A[i] > (leastP * 3 - 3)){
						result++;
					}
					else{
						if ((A[i] > (leastP *3 - 5)) && numTriplets > 0){
							result++;
							numTriplets--;
						}
					}
				}
				else{
					if (A[i] >= leastP){
						result++;
					}
				}
			}
			
			if (cases != T) {fw.write("Case #" + cases + ": "+ result + "\n"); }
			else{fw.write("Case #" + cases + ": "+ result);}
		}
		fw.flush();
		fw.close();
	}
}
