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 Dancing {
	private static boolean isValidScore(int score) {
		return score >=0 && score <= 10;
	}
	private static boolean canReach (int tot, int p, boolean canSurprise) {
		int n = tot / 3;
		int a,b,c;
		a = n;
		b = n;
		c = tot - a - b;
		int max = -1;
		if (a==c) {
			//a-1, a, a+1
			if (isValidScore(a-1) && isValidScore(a) && isValidScore(a+1) && canSurprise) {
				max = a+1;
			}
			//a, a, a
			else if (isValidScore(a)) max = a;
		}
		if (a+1 == c) {
			//a, a, a+1
			if (isValidScore(a) && isValidScore(a+1)) max = a+1;
		}
		if (a+2 == c) {
			//a, a, a+2
			if (isValidScore(a) && isValidScore(a+2) && canSurprise) max = a+2;
			//a, a+1, a+1
			else if (isValidScore(a) && isValidScore(a+1)) max = a+1;
		}
		return max >= p;
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int i=0; i < T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int numCanReach = 0;
			for (int j=0; j < N; j++) {
				int tot = in.nextInt();
				if (canReach(tot, p, false)) numCanReach++;
				else if (canReach(tot,p, true) && S != 0) {
					numCanReach++;
					S--;
				}
			}
			System.out.println("Case #"+(i+1)+": "+numCanReach);
		}
	}
}
