import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

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();
    }
}