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.*;

/**
 * User: Andrii Baranov
 * Date: 14.04.12
 * Time: 12:59
 */
public class DancingGooglers {

    public static void main(String args[]) throws IOException {
        BufferedReader br = new BufferedReader(new FileReader("B-large.in"));

        int testCases = Integer.parseInt(br.readLine());
        int[] maximumGooglers = new int[testCases];

        String paramString;
        int surprising, maxRes, googlersNumber;
        for (int i = 0; i < testCases; ++i) {
            paramString = br.readLine();
            String params[] = paramString.split(" ");

            googlersNumber = Integer.parseInt(params[0]);
            surprising = Integer.parseInt(params[1]);
            maxRes = Integer.parseInt(params[2]);

            int[] sumOfResults = new int[googlersNumber];
            for (int j = 0; j < googlersNumber; ++j) {
                sumOfResults[j] = Integer.parseInt(params[3 + j]);
            }

            maximumGooglers[i] = numOfBestResults(googlersNumber, surprising, maxRes, sumOfResults);
        }
        br.close();

        BufferedWriter bw = new BufferedWriter(new FileWriter("B-large-out.txt"));
        for (int i = 0; i < maximumGooglers.length; i++) {
            bw.write("Case #" + (i + 1) + ": " + maximumGooglers[i]);
            if (i + 1 < maximumGooglers.length) {
                bw.write("\n");
            }
        }
        bw.close();

    }

    private static int numOfBestResults(int googlersNumber, int surprising, int maxRes, int[] sumOfResults) {
        int res = 0;
        int transformSurprising = 0;

        if(maxRes == 0){
            return googlersNumber;
        }
        if(maxRes == 1){
            for(int i =0; i < googlersNumber; i++){
                if (sumOfResults[i]> 0){
                    res++;
                }
            }
            return res;
        }



        for (int i = 0; i < googlersNumber; ++i) {

            if ((sumOfResults[i] / 3 + 1) >= maxRes) {
                if ((sumOfResults[i] % 3 == 0) && ((sumOfResults[i] / 3 + 1) == maxRes)) {
                    transformSurprising++;
                    res++;
                } else {
                    res++;
                }

            } else if ((sumOfResults[i] % 3 == 2) && ((sumOfResults[i] / 3 + 2) == maxRes)) {
                transformSurprising++;
                res++;
            }
        }

        if (transformSurprising > surprising) {
            return res - (transformSurprising - surprising);
        }
        return res;
    }
}
