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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.Collections;

public class DancingWithGooglers {

	public static void main(String[] args) throws IOException{
		FileReader inf = new FileReader("data/B-large.in"); 
		BufferedReader in = new BufferedReader(inf); 
		FileWriter outf = new FileWriter("result/B-large.out");  
		BufferedWriter out = new BufferedWriter(outf);  
		int numCases = Integer.parseInt(in.readLine());  
		int numGoogler = 0;
		int numSuprising = 0;
		int p = 0;
		int maxResult = 0;
		
		for(int index = 1; index <=numCases; index++)
		{
			/*Begin to get data*/
			String line = in.readLine();  
			String []tokens = line.split(" ");
			numGoogler = Integer.parseInt(tokens[0]);
			numSuprising = Integer.parseInt(tokens[1]);
			p = Integer.parseInt(tokens[2]);
			Integer [] scores = new Integer[numGoogler];
			int k = 0;
			maxResult = 0;
			for(int i = 3; i < tokens.length; i++)
			{
				scores[k++] = Integer.parseInt(tokens[i]);
			}
			/*End of getting data*/
			
			/*Reverse the order*/
			Arrays.sort(scores, Collections.reverseOrder());
			for(int i = 0; i < scores.length;i++)
			{
				if(scores[i] >= 3*p)
				{
					maxResult++;
				}
				else if(scores[i] < p)
				{
					continue;
				}
				else if((scores[i]>=(3*p - 2)) && (scores[i]<= (3*p -1)))
				{
					maxResult++;
				}
				else if((scores[i]>=(3*p - 4)) && (3*p - 4) > 0)
				{
					if(numSuprising > 0)
					{
						maxResult ++;
						numSuprising--;
					}
				}
				else
				{
					continue;
				}
			}
			System.out.println("Case #"+index+": "+maxResult);
			out.write("Case #"+index+": "+" "+maxResult);
			out.newLine();
			out.flush();
		}
		
	}
	
}
