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


public class DancingWithGooglers {

	public int max(int s, int q, int[] score){
		int pass = 0, fail = 0, pos = 0;
		for(int sc : score){
			if(sc == 0){
				if(q == 0)
					pass++;
				else fail++;
			}
			else if(sc == 1){
				if(q <= 1)
					pass++;
				else fail++;	
			}
			else if( (sc + 2) / 3 >= q)
				pass++;
			else if( (sc +1) / 3 +1 < q)
				fail++;
			else 
				pos++;
		}
		
		return pass + Math.min(pos, s);
		
	}
	
	
	public static void main(String[] args) throws FileNotFoundException {
		DancingWithGooglers d = new DancingWithGooglers();
//		int[] c1 = {15,13,11};
//		System.out.println(d.max(1,5,c1));
//		
//		int[] c2 = {23,22,21};
//		System.out.println(d.max(0,8,c2));
//		
//		int[] c3 = {8, 0};
//		System.out.println(d.max(1,1,c3));
//		
//		int[] c4 = {29,20, 8, 18, 18, 21};
//		System.out.println(d.max(2,8,c4));
		
		File f = new File(args[0]);
		Scanner sc = new Scanner(f);
		int l = Integer.parseInt(sc.nextLine());
		for(int i = 1; i <= l ;i++){
			String[] line = sc.nextLine().split(" ");
			int[] c = new int[Integer.parseInt(line[0])];
			int s = Integer.parseInt(line[1]);
			int q = Integer.parseInt(line[2]);
			for(int j = 0; j < c.length; j++)
				c[j] = Integer.parseInt(line[j+3]);
			System.out.printf("Case #%d: %s\n", i, d.max(s, q, c));
		}
	}

}
