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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;



public class googlers {

	public static void main(String[] args) throws IOException {
		 BufferedReader f = new BufferedReader(new FileReader("B-large.in"));
		 // input file name goes above
		 PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("googlers.out")));
		 int x=Integer.parseInt(f.readLine());
		 for (int i = 0; i < x; i++) {
			 int output=0;
			 StringTokenizer base=new StringTokenizer(f.readLine());
			 int no=Integer.parseInt(base.nextToken());
			 int sur=Integer.parseInt(base.nextToken());
			 int max=Integer.parseInt(base.nextToken());
			 
			 int [] sum=new int [no];
			 for (int j = 0; j < no; j++) {
				sum[j]=Integer.parseInt(base.nextToken());
			}
			int[][] calc = new int[no][3];
			for (int j = 0; j < no; j++) {
				if(sum[j]%3!=2)
				{
					calc[j][0]=sum[j]/3;
					calc[j][1]=sum[j]/3;
					calc[j][2]=sum[j]-2*sum[j]/3;
				}
				else{
					calc[j][0] = sum[j] / 3+1;
					calc[j][1] = sum[j] / 3;
					calc[j][2] = sum[j] -(sum[j] / 3 +sum[j]/3+1);	
				}
			}
			for (int j = 0; j < no; j++) {
				boolean found = false;
				for (int j2 = 0; j2 < 3 && !found; j2++) {
					if (calc[j][j2] >= max) {
						output++;
						found = true;
					}
				}
				if (!found) {
					for (int j2 = 0; j2 < 3 && !found && sur > 0; j2++) {
						if (calc[j][j2] + 1 >= max) {
							if(sum[j]>2&& sum[j]%3!=1)
							{
								output++;
								sur--;
								found = true;	
							}
						}
					}
				}
			}
			out.println("Case #"+(i+1)+": "+output);
		}
		 out.close();
		 f.close();
	}
	
}
