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);
        }
    }
}

/**
 *
 * @author amit
 */
import java.io.*;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
//import java.util.Arrays;
//import java.math.BigInteger;

public class GCJ {

    BufferedReader rin;
    BufferedWriter wout;
    int numCases;


    public String getNextInput() {
        try {
        	String line = rin.readLine();
        	String[] aVars = line.split(" ");
        	long count = 0;
        	long N = Long.parseLong(aVars[0]);
        	long S = Long.parseLong(aVars[1]);
        	long P = Long.parseLong(aVars[2]);
        	ArrayList<Long> gc = new ArrayList<Long>();
        	for (int i=0; i<N; i++) {
        		gc.add(Long.parseLong(aVars[i+3]));
        	}
        	Collections.sort(gc);
        	for (int i=gc.size()-1; i>=0; i--) {
        		long t1 = gc.get(i);
        		System.out.println("\nnum: " + t1);
        		long t2 = (long) Math.ceil((double)t1/3.0); 
        		if (t1 ==1 && P==2) break;
        		if (t1 ==0 && P>0) break;
        		if (P<= t2) {
        			count ++;
        			System.out.println("\nadded without S");
        		}
        		else if (S>0 && P<=t2+1) {
        			count ++;
        			S--;
        			System.out.println("\nadded with S");
        		}
        		else break;
        	}
        		/*
        		long t = Long.parseLong(aVars[i+3]);
        		System.out.println("\nscore" + t);
        		if ((t%3)==2) {
        			System.out.println("mod2");
        			if (P <= t/3+1) {
        				count ++;
        			}
        		}
        		else if ((t%3)==1) {
        			System.out.println("mod1");
        			S--;
        			if (P <= t/3 +1) {
        				count++;
        			}
        		}
        		else {
        			gc.add(t);
        			System.out.println("mod3");
        		}
        	}
        	Collections.sort(gc);
        	if (!(gc.isEmpty())) {
	        	for (int i=gc.size()-1; i>=0; i--) {
	        		//System.out.println("\ni: " + i);
	        		long t1 = gc.get(i);
	        		if (P<=t1/3) {
	        			count ++;
	        		}
	        		else if (P<=t1/3+1) {
	        			count ++;
	        			S--;
	        		}
	        		else if (S>0) {
	        			System.out.println("\nError!");
	        		}
	        		else break;
	        	}
        	}*/
        	return Long.toString(count);
        } catch (IOException e) {
            System.out.println("File Error! Could not read line from file");
        }
        return null;
    }
    
    public void writeNextOutput(String s) {
        try {
            wout.write(s);
            wout.write("\n");
        } catch (IOException e) {
            System.out.println("Error! Could not write to the file!");
        }
    }

    public GCJ(String s1, String s2) {
        try {
            rin = new BufferedReader(
                    new FileReader(s1));
            wout = new BufferedWriter(new FileWriter(s2));
            numCases = Integer.parseInt(rin.readLine());

            for(int i=1; i <= numCases; i++){
                System.out.println("case#" + i);
                String sout = getNextInput();
                sout = "Case #" + Integer.toString(i) + ":" + " " + sout;
                writeNextOutput(sout);
                //System.out.println("case#" + i);
            }
            rin.close();
            wout.close();
        } catch (IOException e) {
            System.out.println("File error");
            System.exit(0);
        }
    }

    public static void main(String[] args) {/*
        if (args.length!=2) {
        System.out.println("Enter input file!");
        System.exit(0);
        }*/
        GCJ a = new GCJ("infile.txt", "out.txt");
    }
}
