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.List;


public class DancingWithGooglers1 extends Thread{

	//private static int rating[] = {0,0,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};
	private static int totalJudge = 3;
	/**
	 * @param args
	 */
	public static void main(String[] args)  throws Exception{
		new DancingWithGooglers1().parseFile();
		
		
		
	}
	
	public void parseFile() throws Exception
	{
		File file = null;
		FileReader reader = null;
		BufferedReader br  = null;
		
		File outFile = null;
		PrintWriter prntWriter = null;
		try {
			file = new File("B-small-attempt2.in");
			reader = new FileReader(file);
			br = new BufferedReader(reader);
			
			outFile = new File("B-small-attempt2.out");
			prntWriter =  new PrintWriter(outFile);
			
			
			String str = "";
			int liTotalCases = 0;
			if((str = br.readLine())!=null)
			{
				liTotalCases = Integer.parseInt(str);
				//System.out.println('liTotalCases::: '+liTotalCases);
				for(int i=0;i<liTotalCases;i++)
				{
					//System.out.println('---------------------Start--------------------------------');
					int noOfGooglerWithBest = 0;
					String line = br.readLine();
					String[] strArr = line.split(" ");
					int totalGooglers = Integer.valueOf(strArr[0]);
					int totalSurprise = Integer.valueOf(strArr[1]);
					int bestResult = Integer.valueOf(strArr[2]);
					List<List<RatingSet>> finalRat = new ArrayList<List<RatingSet>>();
					for(int j=3;j<totalGooglers+3;j++) {
//						System.out.print(strArr[j]+" ");
						List<RatingSet> rsSet = isGooglerWithBestResult(Integer.valueOf(strArr[j]), bestResult,totalSurprise);
						System.out.println(rsSet);
						finalRat.add(rsSet);
						
					}
					System.out.println("final: "+finalRat);
					
					List<List<RatingSet>> orderedSet = new ArrayList<List<RatingSet>>();
					
					for(List<RatingSet> res:finalRat){
						if(totalMax(res, bestResult)==res.size()) {
							noOfGooglerWithBest++;
						}
						else {
							orderedSet.add(res);
						}
					}
					System.out.println("orderedSet:: "+orderedSet);
					for(List<RatingSet> remainingSet:orderedSet){
						for(RatingSet rs:remainingSet){
							if(totalSurprise>0 && rs.isSurprisingCondition() && rs.isHavingBestScore(bestResult)) {
								noOfGooglerWithBest++;
								totalSurprise--;
								break;
							} else {
								
							}
						}
					}
					
					System.out.println("Case #"+ (i+1) + ": "+ noOfGooglerWithBest);
					prntWriter.write("Case #"+ (i+1) + ": "+ noOfGooglerWithBest +"\n");
					prntWriter.flush();
					//System.out.println('-------------------End----------------------------------');
				}
				
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
		finally{
			if(reader!=null)
				reader.close();
			if(br!=null)
				br.close();
			
			if(prntWriter!=null)
				prntWriter.close();
		}
	}
	
	
	private int totalMax(List<RatingSet> res,int bestScore){
		int totalBest = 0;
		for(RatingSet r:res) {
			if(r.isHavingBestScore(bestScore)){
				totalBest++;
			}
		}
		System.out.println(totalBest);
		return totalBest;
		
	}
	
	public List<RatingSet>  isGooglerWithBestResult(int totalScore, int bestResult,int totalSurprise) {
		System.out.println("totalScore: "+totalScore);
		
			int n = totalScore/totalJudge;
			ArrayList<Integer> set = new ArrayList<Integer>();
		       for(int i=-2;i<=2;i++){
		    	   if(n-i>=0 && n-i<=10)
		    		   set.add(n-i);
		       }
		       
			List<RatingSet> rsSet = findPosibleSubSets(set, bestResult, totalScore, totalSurprise);
			
		
		return rsSet;
	}
	
	private List<RatingSet> findPosibleSubSets(ArrayList<Integer> set,int bestResult,int totalScore,int totalSurprise){
		List<RatingSet> allSetList = new ArrayList<RatingSet>();
		
		List<RatingSet> rattingSet = getListOfRatingSet(set);
		
		for(RatingSet rs:rattingSet) {
			if(rs.getTotal()==totalScore && rs.isValidRating()){
				allSetList.add(rs);
			}
		}
		
		return allSetList;
	}
	
	private List<RatingSet> getListOfRatingSet(ArrayList<Integer> set){
		List<RatingSet> rattingSet= new ArrayList<RatingSet>();
		
		for(int i=0;i<set.size();i++){
			for(int j=i;j<set.size();j++) {
				for(int k=j;k<set.size();k++) {
					rattingSet.add(new RatingSet(set.get(i), set.get(j), set.get(k)));
				}
			}
		}
		
		
		return rattingSet;
	}
	
}

class RatingSet {
	int r1;
	int r2;
	int r3;
	
	public RatingSet(int r1,int r2,int r3) {
		this.r1 = r1;
		this.r2 = r2;
		this.r3 = r3;
	}
	
	public int getTotal(){
		return r1+r2+r3;
	}
	public boolean isHavingBestScore(int bestScore){
		if(r1>=bestScore) {
			return true;
		}
		else if(r2>=bestScore) {
			return true;
		}
		else if(r3>=bestScore) {
			return true;
		}
		else {
			return false;
		}
	}
	
	public boolean isSurprisingCondition() {
		if(maxRating()-minRating()==2){
			return true;
		} else {
			return false;
		}
	}

	@Override
	public String toString() {
		return "{" + r1 + "," + r2 + "," + r3 + "}";
	}
	
	public int minRating(){
		int min = r1;
		if(r2<min) {
			min = r2;
		}
		if(r3<min){
			min = r3;
		}
		return min;
	}
	
	public int maxRating(){
		int max = r1;
		if(r2>max) {
			max = r2;
		}
		if(r3>max){
			max = r3;
		}
		return max;
	}
	
	public boolean isValidRating(){
		return (maxRating()-minRating()<=2)?true:false;
	}
}

