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

}

import java.util.*;

public class Dancing {
	static int[] topS;
	static int[] topN;
	public static void main(String[] args){
		Scanner reader = new Scanner(System.in);
		fill();
		int times = reader.nextInt();
		for(int k = 1; k <= times; k++){
			int n = reader.nextInt();
			int s = reader.nextInt();
			int p = reader.nextInt();
			
			int[] t = new int[n];
			for(int i = 0; i < n; i++)
				t[i] = reader.nextInt();
			
			int cnt = 0;
			for(int i = 0; i < n; i++){
				if(topN[t[i]] >= p){
					cnt++;
				}else if(topS[t[i]] >= p && s > 0){
					cnt++;
					s--;
				}
			}
			
			System.out.println("Case #"+k+": "+cnt);
		}
	}
	
	public static void fill(){
		topS = new int[31];
		topN = new int[31];
		Arrays.fill(topS, -1);
		for(int n = 0; n <= 30; n++)
			for(int i = 0; i <= 10; i++)
				for(int j = i; j <= Math.min(i+2,10) && i+j <= n && n-i-j <= 10; j++){
					if((Math.abs(i-(n-i-j)) <= 2 && Math.abs(j-(n-i-j)) <= 2) && (Math.abs(i-(n-i-j)) == 2 || Math.abs(j-(n-i-j)) == 2 || j-i==2)){
						topS[n] = Math.max(topS[n], Math.max(i,Math.max(j,n-i-j)));
					}else if(Math.abs(i-(n-i-j)) <= 2 && Math.abs(j-(n-i-j)) <= 2){
						topN[n] = Math.max(topN[n], Math.max(i,Math.max(j,n-i-j)));
					}
				}
	}
}
