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.util.Scanner;

public class DWG
{
	public static int[] SuspA = null;
	public static int[] nonSuspA = null;

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{

		Scanner scnr = new Scanner(System.in);
		int T = scnr.nextInt();
		for (int t = 1; t <= T; t++)
		{

			int N = scnr.nextInt();
			int S = scnr.nextInt();
			int p = scnr.nextInt();

			SuspA = new int[N];
			nonSuspA = new int[N];

			int ans = 0;
			int suspCount = 0;

			for (int n = 0; n < N; n++)
			{
				int x = scnr.nextInt();
				calcCombs(x, p, n);
				 //System.out.printf ( "a (%d) b (%d) \n" , SuspA[n], nonSuspA[n]);

				if (nonSuspA[n] > 0)
				{
					ans++;
				} else
				{
					if (SuspA[n] > 0 && suspCount < S)
					{
						ans++;
						suspCount++;
					}
				}
			}
			System.out.println("Case #" + t + ": " + ans);
			// System.out.printf("Case #%d: %d\n", t, ans);
		}
	}

	private static void calcCombs(int n, int p, int index)
	{
		int sum = n;
		int minP = p;
		int susp = 0;
		int nonSusp = 0;
		for (int i = 0; i <= 10; i++)
		{
			for (int j = 0; j <= 10; j++)
			{
				for (int k = 0; k <= 10; k++)
				{
					if (i + j + k == sum)
					{
						if (i >= minP || j >= minP || k >= minP)
						{
							if (Math.abs(i - j) > 2 || Math.abs(j - k) > 2  || Math.abs(i - k) > 2 )
							{
								continue;
							}
							if (Math.abs(i - j) == 2 || Math.abs(j - k) == 2  || Math.abs(i - k) == 2 )
							{
								if (i == j && j == k)
								{
									susp = susp + 3;
								} else
								{
									susp++;
								}
								//System.out.printf(" susp (%d)(%d)(%d) \n ", i , j, k);
							} else
							{
								if (i == j && j == k)
								{
									nonSusp = nonSusp + 3;
								} else
								{
									nonSusp++;
								}
								nonSusp++;
								//System.out.printf(" nonsusp (%d)(%d)(%d) \n ", i , j, k);
							}
						}
					}
				}
			}
		}
		 //System.out.printf("susp: %d nonsusp: %d", susp/3, nonSusp/3);
		SuspA[index] = susp / 3;
		nonSuspA[index] = nonSusp / 3;
	}

}
