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.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.RandomAccessFile;
import java.nio.ByteBuffer;
import java.nio.channels.FileChannel;
import java.util.ArrayList;
import java.util.StringTokenizer;

/**
 * 
 */

/**
 * @author Manthravadi
 *
 */

class Googler{
	int surpriseValue,nonSurpriseValue;	
	boolean isSurprise;
	
}
public class Triplets {
	
	static int[] nonSurprise=new int[]{0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10};
	static int[] surprise=new int[]{-1,-1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10,-1,-1};
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try{
			BufferedReader br = new BufferedReader(new FileReader("B-small-attempt1.in"));
			//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			int tc=Integer.parseInt(br.readLine());
			int t = 1,len;
			FileChannel rwChannel = new RandomAccessFile("triplets.txt", "rw").getChannel();
			String string = new String();
			
			while(t<=tc){
				int count=0;
				StringTokenizer st = new StringTokenizer(br.readLine(), " ");
				//System.out.println("t value:"+t);
				int[] myArr = new int[st.countTokens()];
				//System.out.println(myArr.length);
				//myArr[0]=n;myArr[1]=s;myAarr[2]=p;
				//System.out.println("token  value: "+st.countTokens());
				for(int i = 0,j=0;st.hasMoreTokens();i++,j++){
					//System.out.println("iteration: "+j);
					myArr[i]=Integer.parseInt(st.nextToken());
				}
					
				ArrayList<Googler> g = new ArrayList<Googler>();
				int p = myArr[2];
				int myArrLength = myArr.length;
				//System.out.println(myArrLength + "is the length");
				for(int i = 3;i<myArrLength;i++){
					//System.out.println("i is: "+i);
					//System.out.println(myArr[i]);
					//System.out.println(surprise[myArr[i]]);
					int s = surprise[myArr[i]];
					int ns = nonSurprise[myArr[i]];
					Googler ge = new Googler();
					if(p<=s || p<=ns || (s==-1 && p<=ns)){					
						if(p<=ns && p<=s){
							ge.isSurprise=false;
							ge.surpriseValue=s;
							ge.nonSurpriseValue=ns;
						}
						else{
							ge.isSurprise=true;
							ge.surpriseValue=s;
							ge.nonSurpriseValue=ns;
						}
						if(s==-1 && p<=ns){
							ge.isSurprise=false;
							ge.nonSurpriseValue=ns;
							ge.surpriseValue=s;
							
						}
						g.add(ge);
					//	System.out.println("Inserted successfully at: "+i);
						
					}	
					
				//	System.out.println("i value: "+i);
					
				}
				for(Googler ge:g){
					if(ge.isSurprise==false){
						count++;
						//System.out.println(count+"false");
					}
					else{
						if(ge.surpriseValue == -1?(ge.nonSurpriseValue>=p && (myArr[1]-- >0)?true:false):(ge.surpriseValue>=p && (myArr[1]-- >0)?true:false))
							count++;
						//System.out.println(count+"true");
					}
				}
				
				g=null;
				
				if(t!=tc)
					string+="Case #"+t+": "+count+"\n";
				
				else
					string+="Case #"+t+": "+count;
				
				t++;
				count = 0;
			}
			
			len = string.length();		
			byte[] buffer = string.getBytes();
			ByteBuffer wrBuf = rwChannel.map(FileChannel.MapMode.READ_WRITE, 0, len);
			wrBuf.put(buffer);
		}
		catch(ArrayIndexOutOfBoundsException aioobe){
			System.out.println(aioobe.getMessage()+" "+aioobe.getCause());
			aioobe.printStackTrace();
		}
		catch(IOException ioe){
			System.out.println("Error : "+ioe.getMessage());
			ioe.printStackTrace();
		}
		
		catch(Exception e){
			System.out.println(e.getMessage());
			e.printStackTrace();
		}
		

	}

}
