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.util.Arrays;
import java.util.PriorityQueue;
import java.util.TreeMap;
import java.util.Vector;


public class Dancers
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		BufferedReader fin;
		try
		{
			BufferedWriter fout = new BufferedWriter(new FileWriter("C:\\Users\\Nick\\Desktop\\CodeJam2012\\BLarge-output.txt"));
			fin = new BufferedReader(new FileReader(args[0]));
			int tests = Integer.parseInt(fin.readLine());
			for(int t = 0; t < tests; t++)
			{
				String line = fin.readLine();
				String[] splitLine = line.split(" ");
				int numScores = Integer.parseInt(splitLine[0]);
				int numSurprises = Integer.parseInt(splitLine[1]);
				int targetScore = Integer.parseInt(splitLine[2]);
				int numAboveScore = 0;
				Vector<Integer> scores = new Vector<Integer>();
				for(int s = 0; s < numScores;s++)
					scores.add(Integer.parseInt(splitLine[s + 3]));
				//Fix score of 0 cases
				if(targetScore > 0)
					while(scores.contains(0))
						scores.remove(new Integer(0));
				//Get all possible >= target score without surprises
				for(int s = 0; s < scores.size(); s++)
				{
					if((scores.get(s) % 3 == 0 && scores.get(s) / 3 >= targetScore) || 
							(scores.get(s) % 3 == 1 && scores.get(s) / 3 + 1 >= targetScore) || 
							(scores.get(s) % 3 == 2 && scores.get(s) / 3 + 1 >= targetScore))
					{
						numAboveScore++;
						scores.remove(s);
						s--;
					}
				}
				//Now add in surprises >= target score
				for(int s = 0; s < scores.size() && numSurprises > 0; s++)
				{
					if((scores.get(s) % 3 == 0 && scores.get(s) / 3 + 1 >= targetScore) || 
							(scores.get(s) % 3 == 1 && scores.get(s) / 3 + 1 >= targetScore) || 
							(scores.get(s) % 3 == 2 && scores.get(s) / 3 + 2 >= targetScore))
					{
						numAboveScore++;
						numSurprises--;
					}
				}
				
				//Print output
				fout.write("Case #" + (t+1) + ": " + numAboveScore);
				fout.newLine();
			}
			fout.close();
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
	}
	
}
