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.*;

class Main
{
	public static void main(String[] args) throws Exception
	{
		Main m = new Main();
		m.foo();
	}
	
	long count = 0;
	void foo() throws Exception
	{
//		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		Scanner s = new Scanner(System.in);
		
		int T = s.nextInt();
		int testNum = 1;
		while(T-->0)
		{
			int numGooglers = s.nextInt();
			int numSurprises = s.nextInt();
			int p = s.nextInt();
			
			int[] scores = new int[numGooglers];
			for(int k=0; k<scores.length; k++)
			{
				scores[k] = s.nextInt();
			}
			
			Arrays.sort(scores);
			
			int ret = 0;
			for(int k=0; k<scores.length; k++)
			{
				int sc = scores[k];
				
				if(sc < p)
					continue;
				
				int d = sc/3;
				int r = sc%3;
				//System.out.printf("sc: %d, d: %d, r: %d\n", sc, d, r);
				
				if(r==0)
				{
					if(d >= p)
					{
						ret++;
						continue;
					}
					// TODO: Handle a surprise
					if(d+1 >= p && numSurprises != 0)
					{
						ret++;
						numSurprises--;
						continue;
					}
				}
				else if(r==1)
				{
					if(d+1 >= p)
					{
						ret++;
						continue;
					}
					// TODO: Handle a surprise
					// I can't.
				}
				else if(r==2)
				{
					if(d+1 >= p)
					{
						ret++;
						continue;
					}
					// TODO: Handle a surprise
					if(d+2 >= p && numSurprises != 0)
					{
						ret++;
						numSurprises--;
						continue;
					}
				}
				
			}
			//ret += numSurprises;
			//ret -= Math.max(0, numSurp - numSurprises);
			
			//System.out.printf("Known surprises: %d, Found surprises: %d\n", numSurprises, numSurp);
			System.out.printf("Case #%d: %d\n", testNum, ret);
			testNum++;
		}
	}
}