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.*;
import java.util.*;

public class core {
	public static void main(String[] argv) throws Exception {
	
		String inputFile = argv[0];
		Scanner scan = null;
		FileReader fR = null;
		BufferedReader bR = null;

		int T;
		
		
		try{
			
			fR = new FileReader(inputFile);
			bR = new BufferedReader(fR);

			
			
			T = Integer.parseInt(bR.readLine());
			
			for(int i = 0; i <= T; i++){
				
				String[] temp = (bR.readLine()).split(" ");
				int[] input = new int[temp.length];
				for(int j =0; j < temp.length; j++){
					input[j] = Integer.parseInt(temp[j]);
				
				}
				
				int N = input[0];
				int S = input[1];
				int p = input[2];
				int[] division = new int[N];
				int[] remainder = new int[N];
				int out=0;
				
				
				for(int k = 3; k < input.length; k++){
					
					division[k-3] = input[k]/3;
					remainder[k-3] = input[k]-(division[k-3]*3);
					//System.out.println("" + division[k-3] + " : " + remainder[k-3] );
				}
				
				//System.out.println();
				
				for(int l = 0; l < division.length; l++){
					if(division[l]>=p){
						out++;
						//System.out.println("Did " + l);
					} else if ((division[l] == (p-1)) && (remainder[l]>0) ){
						out++;
						//System.out.println("Did 1 " + l);
					} else if ((division[l] == (p-2)) && (remainder[l]==2) && S > 0){
						out++;
						S--;
						//System.out.println("Did 2 " + l);
					} else if (division[l] == p-1 && remainder[l] == 0 && S > 0 && division[l] > 0){
						out++;
						S--;
						//System.out.println("Did 3 " + l);
					} 
						
				}
				
				int caseIndex = i+1;
				System.out.println("Case #" + caseIndex + ": " + out);
			
			}
			
		} catch(Exception e){}
	}
}
