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.*;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

public class Main2 {

    public static void main(String[] args) {
        try {
            Scanner in = new Scanner(new BufferedReader(new FileReader("in.txt")));
            BufferedWriter out = new BufferedWriter(new FileWriter("out.txt"));
            int t;
            t = in.nextInt();
            in.nextLine();
            for (int i = 1; i <= t; i++) {
                int n, s, p;
                n = in.nextInt();
                int g[] = new int[n];
                s = in.nextInt();
                p = in.nextInt();
                for (int j = 0; j < n; j++) {
                    g[j] = in.nextInt();
                }
                in.nextLine();
                int count = 0;
                for (int k = 0; k < g.length; k++) {
                    if (g[k] != 0 || p == 0) {
                        int div = g[k] / 3;
                        int mod = g[k] % 3;
                        if (mod == 0) {
                            if (div >= p) {
                                count++;
                            } else if (div + 1 >= p && s > 0) {
                                count++;
                                s--;
                            }
                        } else if (mod == 1) {
                            if (div + 1 >= p) {
                                count++;
                            }
                        } else {
                            if (div + 1 >= p) {
                                count++;
                            } else if (div + 2 >= p && s > 0) {
                                count++;
                                s--;
                            }
                        }
                    }
                }

                String toPrint = "Case #" + i + ": " + count;
                if (i != t) {
                    toPrint += "\n";
                }
                out.write(toPrint);
            }
            in.close();
            out.close();
        } catch (Exception ex) {
            Logger.getLogger(Main2.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
}
