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

public class Dancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		new Dancing().run();
	}

	Integer[] best = new Integer[31];
	int best(int x) {
		if (best[x] != null)
			return best[x];
		for (int l = 0; l <= Math.min(x, 8); l++) {
			for (int m = l; m <= l + 2 && m + l <= x; m++) {
				int h = l + 2;
				if (l + m + h == x) {
					best[x] = h;
				}
			}
		}
		if (best[x] == null)
			best[x] = -1;
		return best[x];
	}
	
	void run() throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		
		for (int i = 0; i <= 30; i++)
			System.err.println("" + i + "," + best(i) + "," + ((i + 2) / 3));
		
		int T = nextInt();
		for (int tt = 0; tt < T; tt++) {
			int n = nextInt(), s = nextInt(), p = nextInt();
			
			int ans = 0;
			ArrayList<Integer> list = new ArrayList<Integer>();
			for (int i = 0; i < n; i++) {
				int x = nextInt();
				if (x < 2) {
					if (x >= p)
						ans++;
				} else if (x > 28) {
					ans++;
				} else {
					list.add(x);
				}
			}
			
			Integer[] arr = new Integer[0];
			arr = list.toArray(arr);
			
			Arrays.sort(arr);
			
			int rem = s;
			for (int i = 0; i < arr.length; i++) {
				int x = arr[i];
				if (best(x) >= p && (x + 2) / 3 < p && rem > 0) {
					ans++;
					rem--;
				} else if ((x + 2) / 3 >= p) {
					ans++;
				}
			}
			
			System.out.println("Case #" + (tt + 1) + ": " + ans);
		}
		
		out.close();
	}
	
	BufferedReader br;
	StringTokenizer st;
	PrintWriter out;
	
	String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			st = new StringTokenizer(br.readLine());
		}
		return st.nextToken();
 	}
	
	int nextInt() throws IOException {
		return Integer.parseInt(next());
	}
	
}
