/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.util.Scanner;


public class P2 {
	public static void main(String[] args) { 
		Scanner scan = new Scanner(System.in); 
		int t = Integer.parseInt(scan.nextLine());
		for (int i = 0; i < t; i++) { 
			String[] a = scan.nextLine().split(" ");
			int n = Integer.parseInt(a[0]); 
			int s = Integer.parseInt(a[1]); 
			int p = Integer.parseInt(a[2]);
			int count = 0;
			
			int[] scores = new int[a.length-3];
			for (int j = 0; j < scores.length; j++) { 
				scores[j] = Integer.parseInt(a[j + 3]);
			}
			
			for (int j = 0; j < scores.length; j++) { 
				int result = oneApart(scores[j]);
				if (result >= p) { 
					count += 1;
				} else if (scores[j] != 0 && scores[j] % 3 != 1 && result == p - 1 && s > 0) { 
					count += 1;
					s -= 1;
				}
			}
			System.out.println("Case #" + (i+1) + ": " + count);
		}
	}
	
	public static int oneApart(int a) { 
		if (a % 3 == 0) { 
			return a / 3;
		} else if (a % 3 == 1) { 
			return (a-1)/3 + 1; 
		} else if (a % 3  == 2) { 
			return (a-2)/3 + 1;
		}
		return -1;
	}
}
