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.FileReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class DancingWithTheGooglers {
	
	static int N,S,p;
	static int t[];
	
	static int solve() {
		int i,j,k;
		int a,b,c;
		
		int opt[][] = new int[N+1][S+1];
		boolean canMakeOne, goodScoreCaseOneBigger, goodScoreCaseOneSmaller;
		boolean canMakeTwo, goodScoreCaseTwoBigger, goodScoreCaseTwoSmaller;
		
		for (i=1;i<=N;i++) {
			
			// we need to get t[i]
			canMakeOne = false;
			goodScoreCaseOneBigger = false;
			goodScoreCaseOneSmaller = false;
			canMakeTwo = false;
			goodScoreCaseTwoBigger = false;
			goodScoreCaseTwoSmaller = false;

			for (a=0;a<=10;a++) {
				for (b=a;(b<=a+2)&&(b<=10);b++) {
					for (c=b;(c<=a+2)&&(c<=10);c++) {
						if ((a+b+c) == t[i]) {
							if ((c-a) <= 1) {
								canMakeOne = true;
								if (c >= p)
									goodScoreCaseOneBigger = true;
								else
									goodScoreCaseOneSmaller = true;
							} else {
								canMakeTwo = true;
								if (c >= p)
									goodScoreCaseTwoBigger = true;
								else
									goodScoreCaseTwoSmaller = true;
							}
						}
					}
				}
			}
			
			if (canMakeOne == true) {
				
				if (goodScoreCaseOneBigger == true) {
					for (j=0;j<=S;j++) {
						opt[i][j] = Math.max(opt[i][j], opt[i-1][j]+1);
					}
				}
				
				if (goodScoreCaseOneSmaller == true) {
					for (j=0;j<=S;j++) {
						opt[i][j] = Math.max(opt[i][j], opt[i-1][j]);
					}
				}
				
			}
			
			if (canMakeTwo == true) {
				
				if (goodScoreCaseTwoBigger == true) {
					for (j=1;j<=S;j++) {
						opt[i][j] = Math.max(opt[i][j], opt[i-1][j-1]+1);
					}
				}
				
				if (goodScoreCaseTwoSmaller == true) {
					for (j=1;j<=S;j++) {
						opt[i][j] = Math.max(opt[i][j], opt[i-1][j-1]);
					}
				}
				
			}
			
		}
		
		return opt[N][S];
	}
	
	public static void main(String[] args) throws Exception {
		int i,j,k;
		
		BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
		PrintWriter out = new PrintWriter("B-large.out");
		StringTokenizer st;
		
		int T = Integer.parseInt(br.readLine());
		
		for (k=1;k<=T;k++) {
			
			st = new StringTokenizer(br.readLine());
			N = Integer.parseInt(st.nextToken());
			S = Integer.parseInt(st.nextToken());
			p = Integer.parseInt(st.nextToken());
			t = new int[N+1];
			
			for (i=1;i<=N;i++)
				t[i] = Integer.parseInt(st.nextToken());
			
			out.println("Case #"+k+": "+solve());
			
		}
		
		out.close();
		
	}

}
