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


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

public class DancingWiththeGooglers {
	
	public static void main(String[] args) {
		//initialize();
		java.util.Scanner sc = new java.util.Scanner(System.in);
		int testCases = sc.nextInt();
		sc.nextLine();
		for(int i=0;i<testCases;i++){
			int s,p,n,upperBound,lowerBound;
			
			//int[][] triplet;
			int[] sum;
			//boolean[] processed;
			int count = 0;
			
			n = sc.nextInt();
			s = sc.nextInt();
			p = sc.nextInt();
			
			upperBound = 3*p;
			lowerBound = 3*p-5;
			if(lowerBound < 0)
				lowerBound = 0;
			sum = new int[n];
			//processed = new boolean[n];
			//triplet = new int[n][3];
			
			for(int i1=0;i1<n;i1++){
				sum[i1] = sc.nextInt();
				if(sum[i1] >= upperBound-2){ 
					count++;
					//processed[i1] = true;
				}
				else if(sum[i1] > lowerBound){
					//processed[i1] = true;
					if(s > 0){
						s--;
						count++;
					}		
				}
			}
			
			StringBuffer sb = new StringBuffer("Case #");
			sb.append(i+1);
			sb.append(": ");
			
			sb.append(count);
			System.out.println(sb);
		}
	}
	
}