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

public class Googlers {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-large.out")));

        int T = Integer.parseInt(in.readLine());


        for (int q = 1; q <= T; q++) {

            StringTokenizer st = new StringTokenizer(in.readLine());
            int N = Integer.parseInt(st.nextToken());
            int S = Integer.parseInt(st.nextToken());
            int P = Integer.parseInt(st.nextToken());
            int SurCount = 0;
            int[] sum = new int[N];
            int res = 0;
            for (int i = 0; i < sum.length; i++) {
                sum[i] = Integer.parseInt(st.nextToken());
                if (sum[i] >= 2 && (sum[i] + 1) % 3 == 0 && (sum[i] + 1) / 3 >= P) {
                    res++;
                } else if (sum[i] >= 1 && (sum[i] + 2) % 3 == 0 && (sum[i] + 2) / 3 >= P) {
                    res++;
                } else if (sum[i] % 3 == 0) {
                    if (sum[i] / 3 >= P) {
                        res++;
                    } else if (sum[i] >= 3  && SurCount < S && (sum[i] + 3) / 3 >= P) {
                        res++;
                        SurCount++;
                    }
                
                } else if (sum[i] >= 2 && (sum[i] + 4) % 3 == 0 && SurCount < S && (sum[i] + 4) / 3 >= P) {
                    res++;
                    SurCount++;
                }
            //    System.out.println(i + " : " + res + " : " + SurCount);



            }
            out.write("Case #" + q + ": " + res + "\n");
           // System.out.println("BE");

        }
        out.close();
    }
}
