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;


public class testC {

    public static void main(String args[]){
     
        
    	 int arrayInt[];
       String str="";
       int numbersOfGooglers=0;
       int S=0;
       int P=0;
       int index=0;
       int count=0;
       int arrResults[];
       try{
           FileReader fr = new FileReader("2.txt");
           BufferedReader br = new BufferedReader(fr);
           int size = Integer.parseInt(br.readLine());
           for(int loop=0;loop<size;loop++){
        		 str= br.readLine();
        		 char arraychar[] = str.toCharArray();
        		// = new int[100];
        		 arrayInt = new int[100];
        		index=0;
        		count=0;
        		 String s;
        		 s="";
        		 for(int i=0;i<str.length();i++){
        			 if(arraychar[i] != ' '){
        				s+=arraychar[i]; 
        			 }else{
        				 arrayInt[index++] = Integer.parseInt(s);
        				 s="";
        			 }
        		 }
        		 arrayInt[index++] = Integer.parseInt(s);
				 s="";
        		
				 
				 numbersOfGooglers = arrayInt[0];
				 S = arrayInt[1];
				 P = arrayInt[2];
				 arrResults = new int[numbersOfGooglers];
				 index=3;
				 for(int i=0;i<numbersOfGooglers;i++){
					 arrResults[i] = arrayInt[index++];  
				 }
				 
				 int SS=S;
				 int PP=P;
				 int check=0;
				 S=SS;
				 for(int i=0;i<numbersOfGooglers;i++){
					 P=PP;
					 
					while(P<30)
					{
						if(!(P-1<0 || P-2<0)){
							 if(P*3==arrResults[i] || P+(P-1)+(P-1)==arrResults[i] || P+(P+1)+(P+1)==arrResults[i] || P+(P)+(P+1)==arrResults[i] || P+(P)+(P-1)==arrResults[i])
							 {
								 count++;
								 break;
							 }
							 else if(S>0 && ( P+(P-1)+(P+1)==arrResults[i] || P+(P+2)+(P+2)==arrResults[i] || P+(P-2)+(P-2)==arrResults[i] || P+(P-1)+(P-2)==arrResults[i] || P+(P+1)+(P+2)==arrResults[i]))
							 {
								 count++;
								 S--;
								 break;	
							 }
						}else if((P-1<0)){
							 if(P*3==arrResults[i] || P+(P+1)+(P+1)==arrResults[i] || P+(P)+(P+1)==arrResults[i] )
							 {
								 count++;
								 break;
							 }
							 else if(S>0 && (  P+(P+2)+(P+2)==arrResults[i] || P+(P+1)+(P+2)==arrResults[i]))
							 {
								 count++;
								 S--;
								 break;	
							 }
						}else if((P-2<0)){
							 if(P*3==arrResults[i] || P+(P-1)+(P-1)==arrResults[i] || P+(P+1)+(P+1)==arrResults[i] || P+(P)+(P+1)==arrResults[i] || P+(P)+(P-1)==arrResults[i])
							 {
								 count++;
								 break;
							 }
							 else if(S>0 && ( P+(P-1)+(P+1)==arrResults[i] || P+(P+2)+(P+2)==arrResults[i] || P+(P+1)+(P+2)==arrResults[i]))
							 {
								 count++;
								 S--;
								 break;	
							 }
						}
						
						
					 P++;
					} 
/*					 	
							 if(arrResults[i]/P<4){
								 if(arrResults[i]%P < 2){
									 count++;
									 break;
								 }else if(arrResults[i]%P == 2 && S>0){
									 count++;
									 S--;
									 break;
								 }
							 }
								 P++;
	*/						
						
				 }
				 System.out.println("Case #"+(loop+1)+": "+count);
				/* for(int j=0;j<numbersOfGooglers;j++)
    			 System.out.print(arrResults[j]+" ");
    		 System.out.println();*/
				 
				 
  }
       br.close();
       fr.close();
   
   }catch(IOException ex){
       ex.printStackTrace();
   }
      
}


}
