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

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;

public class B {
	public static void main(String[] args) throws IOException {
		for (int i=0; i<=10; i++) {
			System.out.println(Math.max((i-2)+(i-2)+i,i));
		}
		
		
		// Use BufferedReader rather than RandomAccessFile; it's much faster
		BufferedReader f = new BufferedReader(new FileReader("B-large.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-large.out")));

		HashMap<Integer, ArrayList<String>> debug = new HashMap<Integer, ArrayList<String>>();

		int cases = Integer.parseInt(f.readLine());
		for (int zz = 1; zz <= cases; zz++) {
			String x = f.readLine();
			StringTokenizer st = new StringTokenizer(x);
			int n = Integer.parseInt(st.nextToken());
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());  //At least p for BEST score.
			int[] points = new int[n];
			int ans = 0;

			// Assume p = 5
			int magicNum = Math.max((p - 2) + (p - 2) + p,p); // 3 3 5 or 3 4 5
			// magicNum and MagicNum+1 are always be surprising

			// 3 5 5 or 4 4 5
			// magicNum+2 may be surprising or not.

			//p=0 -2 -2 0
			//p=1 -1 -1 1
			//p=2  0  0 2
			//p=3  1  1 3
			//p=4  2  2 4 
			
			for (int xx = 0; xx < n; xx++) {
				points[xx] = Integer.parseInt(st.nextToken());
				
				if (p==0 || p==1) {
					if (points[xx]>=p)
						ans++;
					continue;
				}
				
				if (s > 0 && (points[xx] == magicNum || points[xx] == magicNum + 1)) {
					s--;
					ans++;
				} else if (points[xx] >= magicNum + 2) {
					ans++;
				}
			}
			out.println("Case #" + zz + ": " + ans);

		}

		out.close(); // close the output file
		System.exit(0); // don't omit this!
	}

}