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

public class gcj2 {
	static int T; // tesztesetek szÃ¡ma
	static int N[]; // Googlerek szÃ¡mai
	static int S[]; // meglepÅ tripletek szÃ¡ma
	static int p[]; // pÃ©k
	static int total[][]; // Ã¶sszpontszÃ¡mok
	static int tripletek[][];
	
	
	static void beolvas (String f) throws IOException {
		BufferedReader be = new BufferedReader(new FileReader(f));
		String sor = be.readLine();
		T = Integer.parseInt(sor);
		N = new int[T];
		S = new int[T];
		p = new int[T];
		tripletek = new int[T][3];
		for (int i = 0; i < T; i++) {
			sor = be.readLine();
			String nums[] = sor.split(" ");
			N[i] = Integer.parseInt(nums[0]);
			S[i] = Integer.parseInt(nums[1]);
			p[i] = Integer.parseInt(nums[2]);
		}
		be.close();
		
		int Nmax = N[0];
		for (int j = 0; j < T; j++){
			if (N[j] > Nmax) Nmax = N[j];
		}
		total = new int[T][Nmax];
		BufferedReader be2 = new BufferedReader(new FileReader(f));
		sor = be2.readLine();
		for (int i = 0; i < T; i++) {
			sor = be2.readLine();
			String nums[] = sor.split(" ");
			for (int j = 0; j < N[i]; j++) {
				total[i][j] = Integer.parseInt(nums[3+j]);
			}
		}
		be2.close();
	}
	
	static void kiir () {
		System.out.println(T);
		for (int i = 0; i < T; i++) {
			System.out.print(N[i]+" "+S[i]+" "+p[i]+" ");
			for (int j = 0; j < N[i]; j++) {
				System.out.print(total[i][j]+" ");
			}
			System.out.println();
		}
	}
	
	static int count (int a) {
		int er = 0;
		int surp = S[a];
		for (int i = 0; i < N[a]; i++) {
			if (total[a][i] >= (3*p[a])-2) {
				er++;
			} else {
				if (surp > 0 && total[a][i] >= (p[a]+2*(p[a]-2)) && p[a] > 1) {
					er++;
					surp--;
				}
			}
		}
		return er;
	}
	
	public static void main (String args[]) throws IOException {
		beolvas("B-large.in");
		// kiir();
		for (int a = 0; a < T; a++) {
			System.out.println("Case #"+(a+1)+": "+count(a));
		}
	}
}

