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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;


public class DancingGooglers {
        public static void main(String[] args) throws IOException {
                BufferedReader fInput = new BufferedReader(new FileReader("res/inputB.in"));
                PrintWriter fOutput = new PrintWriter(new BufferedWriter(new FileWriter(
                                "res/outputB.out")));
                new DancingGooglers().run(fInput, fOutput);
                fOutput.close();
        }
        
        private void run(BufferedReader fInput, PrintWriter fOutput) throws IOException {
                int T = Integer.parseInt(fInput.readLine());
                for (int i=0; i<T; i++) {
                        int count = 0;
                        String[] inputS = fInput.readLine().split(" ");
                        
                        int N = Integer.parseInt(inputS[0]);
                        int S = Integer.parseInt(inputS[1]);
                        int p = Integer.parseInt(inputS[2]);
                        
                        for (int j=3; j<N+3; j++) {
                                int t = Integer.parseInt(inputS[j]);
                                int base = t/3;
                                
                                int max = t%3==0? base : base+1;
                                if (max >= p) {
                                        count++;
                                        continue;
                                }
                                
                                if (S == 0 || t<2 || t%3==1) continue;
                                
                                max = t%3==0? base+1 : base+2;
                                if (max >= p) {
                                        count++;
                                        S--;
                                }
                        }
                        
                        fOutput.println("Case #" + (i+1) + ": " + count);
                }
        }
}