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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class B {

	public static void readFile() throws FileNotFoundException {
		File f = new File("B-large.in");
		Scanner in = new Scanner(f);
		PrintWriter out = new PrintWriter(new File("B-large"));

		int T, S, p, N;

		T = in.nextInt();
		//System.out.println(T);

		ArrayList<int[]> L = new ArrayList<int[]>();
		int found, q, r;

		for (int i = 0; i < T; i++) {
			found = 0;
			N = in.nextInt();
			//System.out.print(N + " ");
			S = in.nextInt();
			//System.out.print(S + " ");
			p = in.nextInt();
			//System.out.println(p);

			int[] totalPoints = new int[N];

			for (int j = 0; j < N; j++) {
				totalPoints[j] = in.nextInt();
				q = totalPoints[j] / 3;
				r = totalPoints[j] % 3;
				// //System.out.println(q + "--" + r);
				if (r == 0)
					L.add(new int[] { q, q, q });
				else if (r == 1)
					L.add(new int[] { q, q, q + 1 });
				else
					L.add(new int[] { q, q + 1, q + 1 });

				int lastIndex = L.size() - 1;

				if (L.get(lastIndex)[0] >= p || L.get(lastIndex)[1] >= p
						|| L.get(lastIndex)[2] >= p) {
					//System.out.println("1111111111");
					found++;
					continue;
				} else {
					if (L.get(lastIndex)[0] + L.get(lastIndex)[1]
							+ L.get(lastIndex)[2] < 3 * p - 4) {
						//System.out.println("2222222222");
						continue;
					}
					if (S > 0 && q > 1) {
						//System.out.println("333333333333");
						L.get(lastIndex)[1]--;
						L.get(lastIndex)[2]++;
						S--;
						found++;
					}
				}
				
			}
			//System.out.println("Found : " + found);
			if (i < T - 1)
				out.println("Case #"+ (i + 1) + ": " + found);
			else
				out.print("Case #"+ (i + 1) + ": " + found);
		}

		// //System.out.println(L.get(3)[0]);

		out.close();
	}

	public static void main(String[] args) throws FileNotFoundException {
		readFile();

	}

}
