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 B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();
		int N, S, p;

		for (int x = 1; x <= T; x++) {
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();

			int[] t = new int[N];
			int y = 0;

			for (int i = 0; i < N; i++) {
				t[i] = in.nextInt();

				int k = t[i] / 3;
				int j1 = -1, j2 = -1, j3 = -1;
 
				// not surprising triplets
				if ((k + 1) + (k + 1) + k == t[i]) {
					j1 = k + 1;
					j2 = k + 1;
					j3 = k;
				}

				else if ((k + 1) + k + k == t[i]) {
					j1 = k + 1;
					j2 = k;
					j3 = k;
				}

				else if (3 * k == t[i]) {
					j1 = k;
					j2 = k;
					j3 = k;
				}

				if (j1 >= p || j2 >= p || j3 >= p) {
					y++;
					continue;
				}

				if(S==0) continue;
				
				// surprising triplets
				if (k != 9 && (k + 2) + k + k == t[i]) {
					j1 = k + 2;
					j2 = k;
					j3 = k;
				} else if (k != 0 && ((k + 1) + (k + 1) + (k - 1) == t[i])) {
					j1 = k + 1;
					j2 = k + 1;
					j3 = k - 1;
				} else if (k != 0 && ((k + 1) + k + (k - 1) == t[i])) {
					j1 = k + 1;
					j2 = k;
					j3 = k - 1;
				}
				
				if (j1 >= p || j2 >= p || j3 >= p) {
					y++;
					S--;
					continue;
				}

			}

			System.out.println("Case #" + x + ": " + y);
		}
	}
}
