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);
        }
    }
}

public class P {

   public static void main(String[] arg) { 

      //greedyPossibleTuple(new int[] {29,20,8,18, 18,21},8,2);
      //greedyPossibleTuple(new int[] {8,0}, 1,1);
      //greedyPossibleTuple(new int[] {23, 22, 21, 20, 29}, 8, 0);
      //System.out.println(parseLine("6 2 8 29 20 8 18 18 21"));

      java.io.BufferedReader in = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));
      try {
         String line;
         java.util.ArrayList<String> lines = new java.util.ArrayList<String>();
         while((line = in.readLine())!=null) {
              lines.add(line);
         }

         for(int i=1;i<lines.size();i++) {
              line = lines.get(i);
              System.out.println("Case #"+i+": "+parseLine(line));
         }

      } catch(Exception e) {
      }      
   }

   public static String parseLine(String l) {
      String[] pt = l.split(" "); 
      int N = Integer.valueOf(pt[0]);
      int S = Integer.valueOf(pt[1]);
      int p = Integer.valueOf(pt[2]);

      int t[] = new int[N];
      for(int i=3;i<pt.length;i++) {
          t[i-3]=Integer.valueOf(pt[i]); 
      }

      //System.out.println("AAA:"+p + "," +S+","+N); 
      return ""+greedyPossibleTuple(t, p, S); 
   }

   public static int greedyPossibleTuple(int[] data, int least, int maxsup) {
      boolean marker[] = new boolean[data.length];

      int scount = 0;
      for(int i=0;i<data.length;i++) {
           marker[i] = false;
           int m = computeTuple(data[i], true);
           if(m>=least) {
              scount++;
              marker[i]=true;
              //System.out.println("S:"+data[i]+","+m);
           }
      }

      int count = scount;
      for(int i=0;i<data.length;i++) {
           int m = computeTuple(data[i], false);
           if(m >= least) {
               //System.out.println("A:"+data[i]);
               if(marker[i]) {
                  scount--;
               } else {
                  marker[i] = true;
                  count++;
               }
           }
      }

      if(scount > maxsup) {
          count -= (scount - maxsup );
      }
      //System.out.println(count + "," +scount + "," + maxsup);

      //System.out.println("....");

      return count;
   }

   public static int computeTuple(int a, boolean s) {
      int min = (int)Math.floor((double)a/3);

      int g = s?2:1;
      int[] mines = {min, min, min};

      int i=0;
      int j=1;
     
      if(mines[0]+mines[1]+mines[2] == a && g<a) {
         mines[0]+=g-1;
         mines[2]-=g-1;
      }
 
      while(mines[0] + mines[1] + mines[2] < a) {
         mines[i]++;
         if(j%g==0) {
             i++;

             if(i>g) i=0;
         }
         j++;
      } 

      //System.out.println(mines[0]); 
      return mines[0];
   }
}
