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 Pilot {

	public static void main(String[] args) {
		Pilot my = new Pilot();

		Calendar cal1 = Calendar.getInstance();
		my.doAll();
		Calendar cal2 = Calendar.getInstance();
		// System.out.println("\nseconds : " + (cal2.getTimeInMillis() -
		// cal1.getTimeInMillis())/1000);
	}

	public void doAll() {
		try {

			String out = "";

			FileInputStream fstream = new FileInputStream("in.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine = "";

			int glob = Integer.parseInt(strLine = br.readLine());

			for (int j = 0; j < glob; j++) {
				int num = 0;
				strLine = br.readLine();
				String[] MAll = strLine.split(" ");
				int N = Integer.parseInt(MAll[0]);
				int S = Integer.parseInt(MAll[1]);
				int p = Integer.parseInt(MAll[2]);

				Integer[][] T = new Integer[N][3];

				for (int i = 0; i < N; i++) {

					int k = Integer.parseInt(MAll[3 + i]);
					T[i][0] = k;

					// non-suprising
					if ((k + 3) % 3 == 0)
						T[i][1] = (k + 3) / 3 - 1;
					else if ((k + 1) % 3 == 0)
						T[i][1] = (k + 1) / 3;
					else if ((k + 2) % 3 == 0)
						T[i][1] = (k + 2) / 3;

					// suprising
					if ((k + 2) % 3 == 0)
						T[i][2] = (k + 2) / 3;
					else if ((k + 3) % 3 == 0)
						T[i][2] = (k + 3) / 3;
					else if ((k + 4) % 3 == 0)
						T[i][2] = (k + 4) / 3;

					if (T[i][2] == 1)
						T[i][2] = -100;

					if (T[i][1] < p)
						T[i][1] = -100;

					if (T[i][2] < p)
						T[i][2] = -100;
				}

				Arrays.sort(T, new Comparator<Integer[]>() {
					@Override
					public int compare(Integer[] entry1, Integer[] entry2) {
						if (entry2[1] < 0 && entry2[2] < 0
								&& (entry1[1] < 0 || entry1[2] < 0))
							return -1;
						else
							return 0;
					}
				});

				int bo = 0, su = 0, no = 0;

				for (int i = 0; i < N; i++) {
					if (T[i][1] >= 0 && T[i][2] >= 0)
						bo++;
					else if (T[i][1] >= 0 && T[i][2] < 0)
						no++;
					else if (T[i][1] < 0 && T[i][2] >= 0)
						su++;
				}

				//System.out.println("both= " + bo + "\nnormal= " + no + "\nsuprising= " + su);

				if (S >= su) {
					num += su;
					S -= su;
					su = 0;
				} else {
					num += S;
					su -= S;
					S = 0;
				}

				if (S == 0) {
					num += no + bo;
				} else {
					num += no + bo;
				}

				for (int i = 0; i < N; i++) {
					//System.out.println(T[i][0] + " " + T[i][1] + " " + T[i][2]);
				}

				out += ("Case #" + (j + 1) + ": " + num + "\n");
			}
			in.close();
			out = out.trim();

			Writer output = null;
			File file = new File("out.out");
			output = new BufferedWriter(new FileWriter(file));
			output.write(out);
			output.close();

			System.out.print(out);

		} catch (Exception e) {
			System.err.println("Error: " + e.getMessage());

		}
	}
}
