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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;


public class Googlers {

	/**
	 * @param args
	 * @throws Exception 
	 */
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		int[] minScoreWithSurprise = new int[11];
		int[] minScoreWithoutSurprise = new int[11];
		
		minScoreWithoutSurprise[0] = 0;
		minScoreWithSurprise[0] = 0;
		minScoreWithoutSurprise[1] = 1;
		minScoreWithSurprise[1] = 1;
		
		for(int i=2; i<minScoreWithoutSurprise.length; i++){
			int score = i * 3;
			minScoreWithoutSurprise[i] = score - 2 ; 
			minScoreWithSurprise[i] = score - 4 ;
			
		}
		
		Scanner sc = new Scanner(new File("B-large.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File("Output.txt")));
		StringBuilder sb = new StringBuilder(50);
		
		int numOfTestcase = sc.nextInt();
		int ans,p,googlers,minSWithoutS,minSwithS,numOfsurprisingTriplets,current;
		for(int i=0;i<numOfTestcase;i++){
			sb.setLength(0);
			googlers = sc.nextInt();
			numOfsurprisingTriplets = sc.nextInt();
			p = sc.nextInt();
			ans = 0;
			minSWithoutS = minScoreWithoutSurprise[p];
			minSwithS = minScoreWithSurprise[p];
			for(int j=0;j<googlers;j++){
				current = sc.nextInt();
				if(current >= minSWithoutS){
					ans++;
				}
				else if(numOfsurprisingTriplets > 0 && current>=minSwithS){
					ans++;numOfsurprisingTriplets--;
				}	
			}
			sb.append("Case #").append(i+1).append(": ").append(ans);
			bw.write(sb.toString());
			bw.newLine();
		}
		bw.close();

	}

}
