import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

public class Run3 {
	class ll {
		public lln f;
		public lln l;
	}

	class lln {
		public Object v;
		public lln n;
	}

	private static Scanner sc;

	public static int gi() {
		return Integer.parseInt(sc.next());
	}

	public static String gn() {
		return sc.next();
	}

	public static void main(String[] args) throws IOException {
		System.setIn(new FileInputStream("B-large.in"));
		System.setOut(new PrintStream("output.txt"));

		sc = new Scanner(System.in);

		int T = gi();

		for (int z = 0; z < T; z++) {

			int N = gi();
			int S = gi();
			int P = gi();

			int[] ti = new int[N];
			for(int i = 0; i < N; i++) {
				ti[i] = gi();
			}

			int c = 0;
			int[][] sc = new int[N][3];
			//System.out.println("z: " + z);
			//System.out.println("N: " + N);
			//System.out.println("S: " + S);
			//ystem.out.println("P: " + P);
			//System.out.println(/*N + " " + */S + " " + P /*+ ' ' + z + " "*/);

			int temp = 0;
			for(int i = 0; i < N; i++) {
				temp = ti[i];
				for(int j = 2; j >= 0; j--) {
					sc[i][j] = temp/(j+1);
					temp -= temp/(j+1);
				}
				Arrays.sort(sc[i]);
				//System.out.println(ti[i] + "\t" + sc[i][0] + "," + sc[i][1] + ","  + sc[i][2] + "\t" + (sc[i][0] + sc[i][1] + sc[i][2]));
			}

			int c2 = 0;
			boolean incc2;

			for (int i = 0; i < N; i++) {
				incc2 = false;
				if(c2 < S) {
					if(sc[i][2] < P && sc[i][2] + 1 == P) {
						/*if(sc[i][2] - sc[i][0] == 1 && sc[i][2] - sc[i][1] == 0) {
							sc[i][2] += 1;
							sc[i][1] -= 1;
							incc2 = true;
						}
						else */
						if(sc[i][0] > 0 && sc[i][2] - sc[i][0] == 0) {
							sc[i][2] += 1;
							sc[i][0] -= 1;
							incc2 = true;
						}
						else if(sc[i][1] > 0 && sc[i][2] - sc[i][0] == 1 && sc[i][2] - sc[i][1] == 0) {
							sc[i][2] += 1;
							sc[i][1] -= 1;
							incc2 = true;
						}
					}
					if(incc2) {
						c2++;
					}
				}
				if(sc[i][2] >= P) {
					c++;
				}
			}

			System.out.format("Case #%d: %d\r\n", z + 1, c);
		}
	}

}
