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

public class probB
{
	public static void main (String[] args)
	{
		Scanner scan = new Scanner (System.in) ;
		
		int T = scan.nextInt();
		int A[], S,p;
		
		for (int t=0 ; t<T ; t++)
		{
			A = new int[scan.nextInt()];
			S = scan.nextInt();
			p = scan.nextInt();
			//System.out.printf("s:%d p:%d\n",S,p);
			
			for (int i=0 ; i<A.length ; i++)
				A[i]=scan.nextInt();
							
			System.out.printf("Case #%d: %d\n",(t+1),solve(S,p,A));
			//System.out.println("******************************************");
		}
	}
	public static int solve (int S, int p, int[] A)
	{
		Arrays.sort(A);
		int result=0 ;
		int s=0, n;
		
		for (int i=0 ; i<A.length ; i++)
		{
			n = A[i];
			
			//no surprise
			
			if (n==0)
			{
				if (p==0)
					result++;
			}
					
			else if (n/3>=p || (n%3!=0 && n/3+1>=p))
				result++;
			
			else if (s<S && ((n%3==0 && n/3+1==p) || (n%3==2 && n/3+2==p)))
			{
				s++;
				result++;
			}
			//System.out.println(n+" "+s+" "+result);
		}
		return result ;
	}
}
