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.util.Scanner;


public class dance {
	public static void main(String... args){
		Scanner in = new Scanner(System.in);
		
		int cases = in.nextInt();
		int[] counts = new int[cases];
		for(int i = 0;i<cases;i++){
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int sUsed = 0; // special cases used
			
			int[] nums = new int[n];
			int[][] scores = new int[n][3];
			for(int k=0;k<n;k++){
				nums[k] = in.nextInt();
				int mod = nums[k] % 3;
				int div = nums[k] /3;
				if (mod == 2 && sUsed < s && div + 2 == p){
					scores[k][0] = div + 2;
					scores[k][1] = div;
					scores[k][2] = div;
					sUsed +=1;
				} else if(mod == 0 && div + 1 == p && sUsed <s && div > 0){
					scores[k][0] = div+ 1;
					scores[k][1] = div;
					scores[k][2] = div-1;
					sUsed += 1;
				}else if (mod == 2){
					scores[k][0] = div + 1;
					scores[k][1] = div + 1;
					scores[k][2] = div;
				} else {
					scores[k][0] = div + mod;
					scores[k][1] = div;
					scores[k][2] = div;
				}
			}
			//count 
			int count = 0;
			for(int k = 0;k<n;k++){
				if(scores[k][0] >= p){
					count++;
				}
			}
			counts[i] = count;
			
		}
		for(int i = 0;i<cases;i++){
			System.out.printf("Case #%d: %d\n",i+1,counts[i]);
		}
		
	}
}
