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.*;
import java.util.*;

class B{}

public class DanceG {
	static Scanner scan;
	static PrintWriter writer;
	static HashMap<Integer, List<Integer>> map;
	
	
	public static void readProcessOutput() throws Exception{
	
		String outputStr = ""; String result = "";
		int index = 1;	
		
		int testCases = Integer.parseInt(scan.nextLine());
		//-------
		
		
		
		//-------
		
		while(index <= testCases ){	//runs testCases number of times
		
			System.out.println("Running testcase : " + index);
			int surprises = 0;
			int count = 0;
			//-----------
			Scanner temp = new Scanner(scan.nextLine());
			int N = temp.nextInt();
			int S = temp.nextInt();
			int p = temp.nextInt();
			int scores[] = new int[N];
			Integer triplet[][] = new Integer[N][3];
			map = new HashMap<Integer, List<Integer>>();
			
			for(int i =0; i < N; i++){
				scores[i] = temp.nextInt();
				int j = scores[i] / 3;
				triplet[i][0] = j + scores[i] % 3;
				if(triplet[i][0] <= 10)
					triplet[i][1] = triplet[i][2] = j;
				else{
					triplet[i][0] = 10;
					triplet[i][1] = j;
					triplet[i][2] = j+1;
				}			
				
				
				
				int min = (int) Collections.min(Arrays.asList(triplet[i]));
				int max = (int) Collections.max(Arrays.asList(triplet[i]));
				
				Arrays.sort(triplet[i]);
				if(triplet[i][2] < p)
					if(max - min == 0 && max != 0){
						triplet[i][0]--;
						triplet[i][2]++;
				}
				
				List<Integer> l = map.get(triplet[i][2]);
				if(l == null)
					l = new ArrayList<Integer>();
				
				l.add(i);
				map.put(triplet[i][2], l);
				
				if(triplet[i][2] - triplet[i][0] == 2){
					surprises++;
				}
			}
			
			Object keys[] = map.keySet().toArray();
			Arrays.sort(keys);
			int m = 0; int n = p;
			while((m = Arrays.binarySearch(keys, n++)) < 0 && n <= 10);
			int r = m;
			for(; m < keys.length && m >= 0; m++)
				count += map.get(((Integer) keys[m])).size();
			
			if(surprises > S){
				
				int diff = surprises - S;
				int j = 0, k = 0;
				while(j < diff && ((Integer) keys[k]) < p){
					//j += map.get(((Integer) keys[k++])).size();
					List<Integer> t = map.get(((Integer) keys[k++]));
					int u = t.size();
					while(--u >= 0){
						int v = t.get(u);
						Arrays.sort(triplet[v]);
						if(triplet[v][2] - triplet[v][0] == 2)
							j++;
						if(j == diff)
							break;
					}
				}
				
				if(k < keys.length && ((Integer) keys[k]) >= p){
					//count -= (diff - j);
					int un = diff - j;
					int s = keys.length - 1;
					while(un > 0){
						List<Integer> l =  map.get(((Integer) keys[s--]));
					
						int q = 0;
						while(q < l.size()){
							int o = l.get(q++);
							if(triplet[o][2] - triplet[o][0] == 2){
								triplet[o][2]--;
								triplet[o][0]++;
								Arrays.sort(triplet[o]);
								if(triplet[o][2] < p){
									count--;
								}
								un--;
								if(un == 0)
									break;
							}
						}
					}
				}
					
			}
			
			else if(surprises < S){
				
				
//				while(surprises < S){
//					List<Integer> l =  map.get(((Integer) keys[r++]));
//				
//					int q = 0;
//					while(q < l.size()){
//						int o = l.get(q++);
//						Arrays.sort(triplet[o]);
//						
//						if(triplet[o][2] - triplet[o][0] < 2 && triplet[o][2] <10){
//							triplet[o][2]++;
//							triplet[o][0]--;
//							surprises++;
//						}
//					
//						if(triplet[o][2] < p){
//							count--;
//						}
//						
//						if(surprises == S)
//							break;
//						
//					}
//				}			
//				
				
				
			}
			
			
			
		
			//------------
			
			
			outputStr = "Case #" + index + ": " + 			count;
			
			writer.println(outputStr);
			
			result = "";
			outputStr = "";
			index++;
			
		}

		scan.close();
		writer.close();
		
	}
	
	
	
	static void setApart(Integer [] arr){

	}
	

	
	public static void main(String[] args) throws Exception {
		
		Scanner in = new Scanner(System.in);
		String className = B.class.getSimpleName() ;
		int choice = 0;
		
		do{
				
			System.out.println("Enter your choice :");
			System.out.println("1) Solve small");
			System.out.println("2) Solve large");
			System.out.print("Choice : ");
			choice = in.nextInt();
			
		switch(choice){
			case 1 :
				scan = new Scanner(new File(className + "-small-practice.in"));
				writer = new PrintWriter(new BufferedWriter(new FileWriter(new File(className +"small.txt"))));
				readProcessOutput();
				System.out.println("Solved successfully!\n"); 
				break;
			case 2 :
				scan = new Scanner(new File(className + "-large-practice.in"));
				writer = new PrintWriter(new BufferedWriter(new FileWriter(new File(className +"large.txt"))));
				readProcessOutput();
				System.out.println("Solved successfully!\n"); 
				break;
		}
		
		
		}while (choice != 0);
		
		System.out.println("Program finished!");
		
	}
}
