package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * 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.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

/*
ID: t.lam1
LANG: JAVA
TASK: codejam
*/
import java.io.*;
import java.util.*;
import java.text.*;
import static java.lang.System.*;
import static java.lang.Integer.*;
import static java.lang.Double.*;
import static java.lang.Character.*;
import static java.util.Collections.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;


class codejam {

  	public static void main (String [] args) throws IOException{
		codejam a=new codejam();
		a.run();
	}
	public void run()throws IOException
	{
		dancing();
	}
	public void recycle()throws IOException{
		Scanner file = new Scanner(new File("codejam.in"));
    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("codejam.out")));
    	int cases = file.nextInt();
    	file.nextLine();
    	ArrayList<String> done = new ArrayList<String>();
    	for(int x =0; x<cases; x++){
    		out.print("Case #"+(x+1)+": ");
    		int a = file.nextInt(), b = file.nextInt(), c = 0;
    		for(int n = a; n<=b; n++){
    			for(int m = n+1; m<=b; m++){
    				if(n<10||m<10)continue;
    				else if(done.contains(""+n+m)){
    					
    				}
    				else{
    					String nn = ""+n, mm=""+m, temp = mm;
    					mm = mm.substring(mm.length()-1)+mm.substring(0,mm.length()-1);
    					while(!mm.equals(temp)){
    						if(mm.equals(nn)){
    							c++;
    							done.add(""+n+m);
    							break;
    						}
    						mm = mm.substring(mm.length()-1)+mm.substring(0,mm.length()-1);
    					}
    				}
    			}
    		}
    		out.println(c);
    	}

    	out.close();
	}
	public void dancing()throws IOException{
		Scanner file = new Scanner(new File("codejam.in"));
    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("codejam.out")));
    	int cases = file.nextInt();
    	file.nextLine();
    	for(int x =0; x<cases; x++){
    		out.print("Case #"+(x+1)+": ");
    		Scanner chop = new Scanner(file.nextLine());
    		int N = chop.nextInt(), S = chop.nextInt(), P = chop.nextInt(), nums = 0;
    		ArrayList<Integer> googlers = new ArrayList<Integer>();
    		for(int y = 0; y<N; y++){
    			googlers.add(chop.nextInt());
    		}
    		System.out.print(N+" "+S+" "+P+" ");
    		for(Integer a: googlers){
    			System.out.println();
    		
    			System.out.println(a+" ");
    			int temp = a/3;
    			int temp2 = a;

    			if(S>0){
    				System.out.println("bye");
    				if(P-(temp2-P)/2==2){
    					S--;
    					nums++;
    				}
	    			if(temp2-2*temp>=P&&(temp2-2*temp)-temp<2)nums++;
	    			else{
	    				temp++;
	    				if((temp2-2*temp>=P||temp==P)&&temp-(temp2-2*temp)<2)nums++;
	    			}
    			}
    			else{
    				System.out.println("hi");
	    			if(temp2-2*temp>=P&&(temp2-2*temp)-temp<2)nums++;
	    			else{
	    				System.out.println("else");
	    				temp++;
	    				if((temp2-2*temp>=P||temp==P)&&temp-(temp2-2*temp)<2)nums++;
	    			}
    			}

    		}
    		System.out.println("nums: "+nums);
    		out.println(nums);
    	}
    	out.close();
	}
	public void googleRese()throws IOException{
		Scanner file = new Scanner(new File("codejam.in"));
    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("codejam.out")));
    	int x = file.nextInt(); file.nextLine();
    	//ArrayList<String> cases = new ArrayList<String>();
    	Map<Character,Character> remap = new TreeMap<Character,Character>();
    	remap.put('a','y');
		remap.put('b','h');
		remap.put('c','e');
		remap.put('d','s');
		remap.put('e', 'o');
		remap.put('f', 'c');
		remap.put('g', 'v');
		remap.put('h', 'x');
		remap.put('i', 'd');
		remap.put('j', 'u');
		remap.put('k', 'i');
		remap.put('l', 'g');
		remap.put('m', 'l');
		remap.put('n', 'b');
		remap.put('o', 'k');
		remap.put('p', 'r');
		remap.put('r', 't');
		remap.put('s', 'n');
		remap.put('t', 'w');
		remap.put('u', 'j');
		remap.put('v', 'p');
		remap.put('w', 'f');
		remap.put('x', 'm');
		remap.put('y','a');
		remap.put('z','q');
		remap.put('q','z');
		remap.put(' ',' ');
        for(int y = 1; y<=x; y++){
        	String temp = file.nextLine();
        	out.print("Case #"+y+": ");
        	for(Character a: temp.toCharArray()){
        		if(remap.get(a)==null)System.out.println(a);
        		out.print(remap.get(a));
        	}
        	out.println();
        }   	
		out.close();
	}

}
