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.*;
import java.io.*;
import java.math.*;
import static java.lang.System.*;
import static java.lang.Math.*;
import static java.lang.Integer.*;

public class B {
	public static void main(String args[]) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		int t = parseInt(br.readLine());
		for(int z=1;z<=t;z++) {
			String ss[] = br.readLine().trim().split("\\s+");
			int T = parseInt(ss[0]);
			int S = parseInt(ss[1]);
			int p = parseInt(ss[2]);
			int[] arr = new int[T];
			for(int i=0;i<T;i++) {
				arr[i] = parseInt(ss[i+3]);
			}
			Arrays.sort(arr);
			int[][] div = new int[T][3];
			for(int i=0;i<T;i++) {
				div[i][0] = arr[i]/3;
				div[i][1] = (arr[i]-div[i][0])/2;
				div[i][2] = arr[i] - div[i][0] - div[i][1];
			}
			while(S-->0) {
				boolean ok = false;
				for(int i=0;i<T;i++) {
					if(div[i][2] < p) {
						switch(arr[i]%3) {
							case 0:
								if(div[i][2] == p-1 && div[i][0] > 0) {
									div[i][2]++;
									div[i][0]--;
									ok = true;
								}
								break;
							case 1:
								break;
							case 2:
								if(div[i][2] == p-1 && div[i][1] > 0) {
									div[i][2]++;
									div[i][1]--;
									ok = true;
								}
								break;
						}
					}
					if(ok) {
						// out.println(Arrays.toString(div[i]));
						break;
					}
				}
				// if(!ok) {
					// for(int i=0;i<T;i++) {
						// if(!isSup(div[i]) && canBeSup(div[i])) {
							// div[i] = sup(div[i]);
							// ok = true;
						// }
						// if(ok) break;
					// }
				// }
			}
			int count = 0;
			for(int i=0;i<T;i++) {
				if(div[i][2] >= p) count++;
				// out.println(div[i][0]+" "+div[i][1]+" "+div[i][2]);
			}
			out.println("Case #"+z+": "+count);
		}
	}
	
	static boolean isSup(int[] div) {
		return (div[2] - div[0] == 2);
	}
	
	static boolean canBeSup(int[] div) {
		return div[0] != 0;
	}	
	
	static int[] sup(int[] div) {
		if(div[0] == div[2]) return new int[]{div[0]-1,div[1],div[2]+1};
		else if(div[1] == div[2]) return new int[]{div[0],div[1]-1,div[2]+1};
		else return new int[]{div[0]-1,div[1]+1,div[2]};
	}
}