package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Dance {

	/**
	 * @param args
	 */
	
	static int test(int n, int p, int surp, int [] ds){
		int res=0;
		int mean,mod;
		
		if (p==0) return n;
		for(int i=0; i<n; i++){
			if (ds[i] == 0) continue;
			mean = ds[i]/3;
			mod = ds[i]%3;
			if (mean >= p
				|| (mean + 1 >= p && mod >= 1)) {res ++; continue;}
		    if (((mod==2 && mean +2 >= p) || (mean+1>=p))&& surp > 0) {res ++; surp --; continue;}
		}
		return res;
	}
	
	public static void main(String[] args) {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int nbtests;
		try {
			nbtests = new Integer(br.readLine());
			for (int i=0; i<nbtests; i++){
				String s = br.readLine();
				String []tmp = s.split(" ",4);
				int n = new Integer(tmp[0]);
				int surp = new Integer(tmp[1]);
				int p = new Integer(tmp[2]);
				String[] dss = tmp[3].split(" ",n);
				int []ds = new int[n];
				for (int j=0; j<n; j++) ds[j]=new Integer(dss[j]);
				
				System.out.println("Case #"+(i+1)+": " + test(n,p,surp,ds));
			}
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
		

	}

}
