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.*;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;

/**
 * Created by IntelliJ IDEA.
 * User: 875k
 * Date: 4/14/12
 * Time: 12:08 AM
 * To change this template use File | Settings | File Templates.
 */
public class prQB {
    public static boolean notSurprising(int a, int b, int c) {
        return Math.abs(a - b) <= 1 && Math.abs(a - c) <= 1 && Math.abs(b - c) <= 1;
    }
    public static boolean surprising(int a, int b, int c) {
        return !notSurprising(a, b, c) && Math.abs(a - b) <= 2 && Math.abs(a - c) <= 2 && Math.abs(b - c) <= 2;
    }
    public static int[] points;
    public static int[] surpriseMax;
    public static int[] normalMax;
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new FileReader("prQB.in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("prQB.out")));
        points = new int[101];
        surpriseMax = new int[101];
        normalMax = new int[101];
        int T = Integer.parseInt(br.readLine());
        for(int i = 0; i < T; i++) {
            Arrays.fill(points, -1);
            Arrays.fill(surpriseMax, -1);
            Arrays.fill(normalMax, -1);
            StringTokenizer st = new StringTokenizer(br.readLine());
            int N = Integer.parseInt(st.nextToken());
            int S = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());
            for(int j = 0; j < N; j++) {
                points[j] = Integer.parseInt(st.nextToken());
                boolean found = false, founds = false;
                for(int a = Math.min(10, points[j]); a >= 0 && !(found && founds); a--) {
                    for(int b = Math.max(0, points[j] - a); b >= 0; b--) {
                        int c = points[j] - a - b;
                        if(notSurprising(a, b, c) && a >= normalMax[j]) {
                            found = true;
                            normalMax[j] = a;
                        }
                        if(surprising(a, b, c) && a >= surpriseMax[j]) {
                            founds = true;
                            surpriseMax[j] = a;
                        }
                    }
                }
            }
            //for(int j = 0; j < N; j++) { System.out.print(points[j] + "-" + normalMax[j] + "-" + surpriseMax[j] + ", "); } System.out.println();
            HashSet<Integer> hs = new HashSet<Integer>();
            for(int j = 0; j < N && S > 0; j++) {
                if(surpriseMax[j] >= p && normalMax[j] < p) {
                    hs.add(j);
                    S--;
                }
            }
            int c = hs.size();
            for(int j = 0; j < N; j++) {
                if(normalMax[j] >= p && !hs.contains(j)) c++;
            }
            out.println("Case #" + (i + 1) + ": " + c);
        }
        out.close();
        System.exit(0);
    }
}
