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.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author home
 */
public class DancingWithGooglers {
    public static void main(String args[])throws IOException{
     FileReader reader = new FileReader("D:\\NetBeansProjects\\DBInteractionWithWS\\src\\java\\B-small-attempt7.in");
		BufferedReader br = new BufferedReader(reader);
		File file = new File("d:\\rloutput.txt");
		FileWriter fw = new FileWriter(file);
		int count = Integer.parseInt(br.readLine());
		for(int s=0;s<count;s++){
                    List list = new ArrayList();
                    String line = br.readLine();
                    //System.out.println(line);
                    int num = Integer.parseInt(line.split(" ")[0]);
                    int triplets =Integer.parseInt(line.split(" ")[1]);
                    int pendingtriplets = triplets;
                    int highest=Integer.parseInt(line.split(" ")[2]);
                    String splits[]=line.split(" ");
                    int resultCount=0;
                    int surpriseCount=0;
                    for(int i=3;i<num+3;i++){
                        
                     
                        int number =Integer.parseInt(splits[i]);
                        Bean be = new Bean();
                        if(number%3==0){
                        
                            
                            be.first =number/3;
                            be.second=number/3;
                            be.third = number/3;
                            if(be.first>=highest){
                                resultCount++;
                            }
                            
                        }else if(number%3==1){
                            
                            be.first= number/3;
                            be.second = number/3;
                            be.third = (number/3)+1;
                            if(be.third>=highest){
                                    resultCount++;
                                    
                                }
                        
                        }else if(number%3==2){
                            if((number/3)==9){
                                be.first=number/3;
                                be.second=be.first+1;
                                be.third=be.first+1;
                                if(be.second>=highest){
                                    resultCount++;
                                  
                                }
                            }else if(pendingtriplets==0){
                                be.first=number/3;
                                be.second=be.first+1;
                                be.third=be.first+1;
                                if(be.second>=highest){
                                    resultCount++;
                                  
                                }
                            }
                            else{
                                be.first=number/3;
                                be.second=(number/3)+2;
                                be.third=number/3;

                                if(be.second>=highest){
                                    resultCount++;
                                    surpriseCount++;
                                    pendingtriplets--;
                                }
                            }
                        }
                    list.add(be);
                    
                    
                    
                    
                    }
                    //System.out.println("triplets :"+triplets+", surprise "+surpriseCount);
                    
                    if(triplets>surpriseCount){
                         for(int cc=0;cc<list.size();cc++){
                             if(triplets>surpriseCount){
                                 //System.out.println("triplets :"+triplets+", surprise "+surpriseCount);
                             Bean be1 = (Bean)list.get(cc);
                           //  System.out.println(be1.first+","+be1.second+","+be1.third);
                             if(((be1.first==be1.second)&&(be1.second==be1.third))&&be1.first!=10&&be1.first!=0){
                             
                                 if((be1.first+1)>=highest){
                                 
                                     be1.first=be1.first-1;
                                     
                                     be1.third =be1.third+1;
                                     if(!(be1.second>=highest))
                                     resultCount++;
                                     surpriseCount++;
                                    
                                 }else if((be1.first-1)>=highest){
                                     be1.first=be1.first-1;
                                     be1.third =be1.third+1;
                                     if(!(be1.second>=highest))
                                     resultCount++;
                                     surpriseCount++;
                                    
                                 }
                             }
                             
                          //   list.add(cc,be1);
                         }
                         }
                    }
                    System.out.println("Case #"+(s+1)+": "+resultCount);
            }
        }
}
class Bean{
    int first;
    int second;
    int third;
}