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.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;


public class Dance {
	
public static int[][] JudgedScores(int a){
	
	int div=a/3;
	int[][] Demo=new int[1][3];
	
	
	if(a==0) { Demo[0][0]=0; Demo[0][1]=0; Demo[0][2]=0;
	
	}
	else {Demo[0][0]=div; Demo[0][1]=div; Demo[0][2]=div;
	
	if(Demo[0][0]+Demo[0][1]+Demo[0][2]==a){} else {Demo[0][0]=Demo[0][0]+1;}
	if(Demo[0][0]+Demo[0][1]+Demo[0][2]==a){} else {Demo[0][1]=Demo[0][1]+1;}
	}
	
	
	return Demo;
}

public static int[][] SurpriseCheck(int a,int b,int[][] c){
	
	int surprisesAllowed=a;
	int bestNo=b;
	int [][] googlerScores=c;
	
	if(surprisesAllowed==0 || bestNo==0 || bestNo==1) return googlerScores;
	else{
		int surprisesDone=0;
		
		for(int i=0;i<googlerScores.length;i++){
			int[][] Demo=new int[1][3];
			Demo[0][0]=googlerScores[i][0];
			Demo[0][1]=googlerScores[i][1];
			Demo[0][2]=googlerScores[i][2];
			
			int flag=0;
			
			if(Demo[0][0]>=bestNo) {flag=1;}
			else if(Demo[0][1]>=bestNo) {flag=1;}
			else if(Demo[0][2]>=bestNo) {flag=1;}
			
			else if(flag==0){
				
				Demo[0][0]=Demo[0][0]+1; Demo[0][1]=Demo[0][1]-1;
				if(Demo[0][0]-Demo[0][1]>2 || Demo[0][0]-Demo[0][1]<-2 || Demo[0][0]-Demo[0][2]>2 || Demo[0][0]-Demo[0][2]<-2){
					
					Demo[0][0]=Demo[0][0]-1; Demo[0][1]=Demo[0][1]+1;
				}
				else{
					
					if(Demo[0][0]==bestNo)
					{flag=1;}
					
					else {Demo[0][0]=Demo[0][0]-1;  Demo[0][1]=Demo[0][1]+1;  }
					
				}
				
	if(flag==0){
					
		Demo[0][0]=Demo[0][0]+1; Demo[0][1]=Demo[0][2]-1;
		if(Demo[0][0]-Demo[0][1]>2 || Demo[0][0]-Demo[0][1]<-2 || Demo[0][0]-Demo[0][2]>2 || Demo[0][0]-Demo[0][2]<-2){
			
			Demo[0][0]=Demo[0][0]-1;  Demo[0][2]=Demo[0][2]+1;
		}
		else{
			
			if(Demo[0][0]==bestNo)
			flag=1;
			
			else {Demo[0][0]=Demo[0][0]-1; Demo[0][2]=Demo[0][2]+1;}
			
		}
					}
				
				
				if(flag==0){
					
					Demo[0][0]=Demo[0][0]+2; Demo[0][1]=Demo[0][1]-1; Demo[0][2]=Demo[0][2]-1;
					if(Demo[0][0]-Demo[0][1]>2 || Demo[0][0]-Demo[0][1]<-2 || Demo[0][0]-Demo[0][2]>2 || Demo[0][0]-Demo[0][2]<-2){
						
						Demo[0][0]=Demo[0][0]-2;Demo[0][1]=Demo[0][1]+1; Demo[0][2]=Demo[0][2]+1;
					}
					else{
						
						if(Demo[0][0]==bestNo)
						flag=1;
					
						else{ Demo[0][0]=Demo[0][0]-2; Demo[0][1]=Demo[0][1]+1; Demo[0][2]=Demo[0][2]+1;}
						
					}
					}
			
				
if(flag==0){
					
					Demo[0][1]=Demo[0][1]+1; Demo[0][0]=Demo[0][0]-1;
					if(Demo[0][1]-Demo[0][0]>2 || Demo[0][1]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
						
						Demo[0][1]=Demo[0][1]-1;Demo[0][0]=Demo[0][0]+1;
					}
					else{
						
						if(Demo[0][1]==bestNo)
						flag=1;
						
						else {Demo[0][1]=Demo[0][1]-1;Demo[0][0]=Demo[0][0]+1;}
						
					}
					}

if(flag==0){
	
	Demo[0][1]=Demo[0][1]+1; Demo[0][2]=Demo[0][2]-1;
	if(Demo[0][1]-Demo[0][0]>2 || Demo[0][1]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][1]=Demo[0][1]-1;Demo[0][2]=Demo[0][2]+1;
	}
	else{
		
		if(Demo[0][1]==bestNo)
		flag=1;
		
		else {Demo[0][1]=Demo[0][1]-1;Demo[0][2]=Demo[0][2]+1;}
		
	}
	}

if(flag==0){
	
	Demo[0][1]=Demo[0][1]+2; Demo[0][0]=Demo[0][0]-1;Demo[0][2]=Demo[0][2]-1;
	if(Demo[0][1]-Demo[0][0]>2 || Demo[0][1]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][1]=Demo[0][1]-2; Demo[0][0]=Demo[0][0]+1;Demo[0][2]=Demo[0][2]+1;
	}
	else{
		
		if(Demo[0][1]==bestNo)
		flag=1;
		
		else {Demo[0][1]=Demo[0][1]-2;Demo[0][0]=Demo[0][0]+1;Demo[0][2]=Demo[0][2]+1;}
		
	}
	}
if(flag==0){
	
	Demo[0][2]=Demo[0][2]+1; Demo[0][0]=Demo[0][0]-1;
	if(Demo[0][2]-Demo[0][0]>2 || Demo[0][2]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][2]=Demo[0][2]-1;Demo[0][0]=Demo[0][0]+1;
	}
	else{
		
		if(Demo[0][2]==bestNo)
		flag=1;
		
		else {Demo[0][2]=Demo[0][2]-1;Demo[0][0]=Demo[0][0]+1;}
		
		}
	}

if(flag==0){
	
	Demo[0][2]=Demo[0][2]+1; Demo[0][1]=Demo[0][1]-1;
	if(Demo[0][2]-Demo[0][0]>2 || Demo[0][2]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][2]=Demo[0][2]-1;Demo[0][1]=Demo[0][1]+1;
	}
	else{
		
		if(Demo[0][2]==bestNo)
		flag=1;
		
		else {Demo[0][2]=Demo[0][2]-1;Demo[0][1]=Demo[0][1]+1;}
		
		}
	}

if(flag==0){
	
	Demo[0][2]=Demo[0][2]+1;Demo[0][0]=Demo[0][0]-1;Demo[0][1]=Demo[0][1]-1;
	if(Demo[0][2]-Demo[0][0]>2 || Demo[0][2]-Demo[0][0]<-2 || Demo[0][1]-Demo[0][2]>2 || Demo[0][1]-Demo[0][2]<-2){
		
		Demo[0][2]=Demo[0][2]-1;Demo[0][0]=Demo[0][0]+1;Demo[0][1]=Demo[0][1]+1;
	}
	else{
		
		if(Demo[0][2]==bestNo)
		flag=1;
		
		else {Demo[0][2]=Demo[0][2]-1;Demo[0][0]=Demo[0][0]+1;Demo[0][1]=Demo[0][1]+1;}
		
	}
	}


if(flag==1) surprisesDone=surprisesDone+1;
				
			}	
			
			googlerScores[i][0]=Demo[0][0];
			googlerScores[i][1]=Demo[0][1];
			googlerScores[i][2]=Demo[0][2];
			
			if(surprisesDone==surprisesAllowed){return googlerScores;}
			}
		
	
		
	}
	
	return googlerScores;
}
	

public static int checkResult(){
	
	return 0;

}
	public static void main(String args[]) throws Exception{
		BufferedReader reader = new BufferedReader(new FileReader(new File("C:/Users/Faisal/Downloads/B-small-attempt0.in")));
		BufferedWriter writer = new BufferedWriter(new FileWriter(new File("B-small-attempt0.in")));
		String line = reader.readLine();
		int k = Integer.parseInt(line);
		int count=1;
		for(int i = 0 ; i < k ; i ++){
			line = reader.readLine();
		
		String[] newLine=line.split(" ");
			
			
			
			
			System.out.println(count);
			count++;
			int noOfGooglers=Integer.parseInt(newLine[0]); System.out.println("noOfGooglers "+noOfGooglers);
			int surprises=Integer.parseInt(newLine[1]);
			int bestNo=Integer.parseInt(newLine[2]);
			int[] totalScores=new int[noOfGooglers]; 
			
			for(int j=3,n=0;j<newLine.length;j++,n++){
				totalScores[n]=Integer.parseInt(newLine[j]);
				System.out.println("totalScores "+totalScores[n]);
				
		    }
			
			int [][] googlerScores=new int[noOfGooglers][3];
			
			for(int j=0;j<totalScores.length;j++){
				
				int[][] Demo=JudgedScores(totalScores[j]);
				googlerScores[j][0]=Demo[0][0];
				googlerScores[j][1]=Demo[0][1];
				googlerScores[j][2]=Demo[0][2];
				
			}
			
			googlerScores=SurpriseCheck(surprises,bestNo,googlerScores);
			int result=0;
			for(int h=0;h<googlerScores.length;h++){
				if(googlerScores[h][0]>=bestNo || googlerScores[h][0]>=bestNo || googlerScores[h][0]>=bestNo ){
					
					result++;
					
				}
			}
			
			
	       
			int Case=i+1;
	        writer.write("Case #" + Case + ": ");
		    writer.write(Integer.toString(result)); 
	       if(Case==k){} else{writer.write("\n"); }
   
			
		}
		reader.close();
		writer.close();
	}

}

