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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;


public class googler {
	
	private static File f = new File("C:/Users/Cybermask/Desktop/myfile.txt");
	private static File outfile = new File("C:/Users/Cybermask/Desktop/out.txt");
	
	
	private static BufferedReader reader;
	private static int getMaximum(int element,int surprisingindex){
		if(element==0)return 0;
		boolean surprising;
		if(surprisingindex==0)surprising=false;
		else surprising=true;
		if(!surprising){
			if(element%3 ==0)return element/3;
			if(element%3 ==1)return ((element-1)/3)+1;
			else return ((element-2)/3)+1;
		}else{
		  if(element%3 ==0 )return (element/3)+2;
		  else if(element%3 == 1 ) return ((element-1)/3)+2;
		  else return ((element-2)/3)+2;
		}
		
	}
	private static String read() throws Exception{
		return reader.readLine();
	}
	private static int toint(String s){
		return Integer.parseInt(s);
	}
	private static ArrayList<Object> reverse(ArrayList<Object>list){
		ArrayList<Object> result = new ArrayList<Object>();
		for(int i=0;i<list.size();i++)
			result.add(list.get(list.size()-i-1));
		return result;
		
	}
/*	private static int count(int element){
		int count=0;
		while(true){
			count+=element%2;
			element=(int)(element/2.0);
			if(element==0)return count;
		}
	}*/
	
	private static int[] count = new int[100];
	
public static void main(String args[])throws Exception{
	//System.out.println(getMaximum(23,1)+":"+getMaximum(23,0));
	reader = new BufferedReader(new FileReader(f));
	BufferedReader countreader = new BufferedReader(new FileReader("C:/Users/Cybermask/Desktop/count.txt"));
	for(int i=0;i<100;i++)count[i]=toint(countreader.readLine());
	PrintWriter pw = new PrintWriter(outfile);
	int n = toint(read());
	
	for(int i=0;i<n;i++){
		Scanner scanner = new Scanner(read());
		scanner.useDelimiter(" ");
		int googlerscount = scanner.nextInt();
		int surprising = scanner.nextInt();
		int max = scanner.nextInt();
		int googlers [] =new int[googlerscount];
		for(int k=0;k<googlerscount;k++)googlers[k]=scanner.nextInt();
		
		
		int totalmax=0;
		//if(googlerscount>3)googlerscount=3;
		int total = (int)Math.pow(2,googlerscount);
		for(int j=0;j<total;j++){
			if(count[j]!=surprising)continue;
			int max1=0;
			
			int jc = j;
			int z = 0;
			int o = ((int)(j/2.0))%2;
			int t = ((int)(j/4.0))%2;
		/*	if(getMaximum(googlers[0],z)>=max)max1=1;
		    if(googlerscount>1)if(getMaximum(googlers[1],o)>=max)max2=1;
	        if(googlerscount>2)if(getMaximum(googlers[2],t)>=max)max3=1;*/
	        for(int k=0;k<googlerscount;k++){
	        z = jc%2;
	        if(getMaximum(googlers[k],z)>=max)max1++;
	        jc = (int)(jc/2.0);
	        }
			if(max1>totalmax)totalmax=max1;
		} 
		pw.println("Case #"+(i+1)+": "+totalmax);
		
	}
	pw.flush();
	
}
}
