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

public class Prof2ProB {
    public static void main(String args[]) {
        try {
            BufferedReader breader = new BufferedReader(new FileReader("F:\\test.txt"));
            int noo;
            noo= Integer.parseInt(breader.readLine());

            int casen=0;
            int noofgglrs;
            int specialcases;
            int maxnumber,i;
            String tempstr;
            String outp;
            outp="";
            String nos[];
            int tmp;
            int count;

            while( casen < noo ) {
                tempstr = breader.readLine();
                nos = tempstr.split(" ");
                outp += "Case #"+(casen+1)+": ";

                noofgglrs = Integer.parseInt(nos[0]);
                specialcases = Integer.parseInt(nos[1]);
                maxnumber = Integer.parseInt(nos[2]);

                count = 0;

                for(i=0;i<noofgglrs;i++) {
                    tmp = Integer.parseInt(nos[i+3]);

                    if( tmp / 3 >= maxnumber )
                        count++;
                    else if( tmp%3 == 1 && (tmp/3)+(tmp%3) >= maxnumber) {
                        System.out.println("here2:" + tmp);
                        count++;
                    }
                    else if( tmp%3 == 2 && specialcases > 0 && (tmp%3)+(tmp/3) >= maxnumber ) {
                        System.out.println("here: " + tmp);
                        count++;
                        specialcases--;
                    }
                    else if( tmp%3 == 2 && ((tmp/3)+((tmp/3)+1)*2) == tmp && (tmp/3)+1>=maxnumber ) {
                        System.out.println("here3: " + tmp);
                        count++;
                    }
                    else if( tmp!=0 && tmp%3 == 0 && specialcases > 0 && (tmp/3)+1 >= maxnumber ) {
                        System.out.println("here1: " + tmp);
                        count++;
                        specialcases--;
                    }
                }
                outp += count;
                if( casen != noo-1 )
                    outp += "\n";
                casen++;
            }
            System.out.println(outp);

            BufferedWriter bwrtr = new BufferedWriter( new FileWriter("F:\\result.txt"));
            bwrtr.write(outp);
            bwrtr.close();
            breader.close();
        }
        catch( Exception e ) {
            e.printStackTrace();
        }
    }
}
