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.Arrays;
public class GoogleCodeJam2 
{
    public static void main(String[] args) throws IOException 
    {
        FileInputStream fstreami = new FileInputStream("input.txt");
        DataInputStream in = new DataInputStream(fstreami);
        FileWriter fstreamo = new FileWriter("output.txt");
        BufferedWriter out = new BufferedWriter(fstreamo);
        int testCases = Integer.parseInt(in.readLine());
        int i = 0;
        while(i < testCases)
        {
            String test = in.readLine();
            String [] testInput = test.split(" ");
            int [] input = new int[testInput.length-3];
            int googlers = Integer.parseInt(testInput[0]);
            int allowed = Integer.parseInt(testInput[1]);
            int max = Integer.parseInt(testInput[2]);
            int possible = 0;
            for (int j = 0; j < testInput.length-3; j++)
                input[j] = Integer.parseInt(testInput[3+j]);
            Arrays.sort(input);
            for (int j = googlers-1; j >= 0; j--)
            {
                if (input[j]%3 == 0)
                {
                    if (input[j]/3 >= max)
                        possible++;
                    else if ((input[j]+3)/3 >= max && allowed>=1 && input[j]>=3)
                    {
                        possible++;
                        allowed--;
                    }
                    else ;
                }
               else if (input[j]%3 == 1)
                {
                    if (((input[j]+2)/3) >= max && input[j]>=1)
                        possible++;
                    else ;
                }
                else
                {
                    if (((input[j]+1)/3) >= max && input[j]>=2)
                        possible++;
                    else if (((input[j]+4)/3) >= max && allowed>=1 && input[j]>=2)
                    {
                        possible++;
                        allowed--;
                    }
                    else ;
                }
			}
		//	System.out.println("Done");
            out.write("Case #" + (i+1) + ": " + possible + "\n");
			i++;
		}
		in.close();
		out.close();
    }
}