import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

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