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

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

import java.io.*;
import java.util.*;

/**
 *
 * @author HP
 */
public class DancingWithGooglers{

    /**
     * @param args the command line arguments
     */
    
    static int getLargest(List<Integer>L ,boolean[]S)
    {
        int max=0,o = 0;
        for(int i=0;i<L.size();i++)
        {
            if(L.get(i)>max && !S[i])
            {
                max = L.get(i);
                o=i;
            }
        }
        return o;
    }
    
    
    public static void main(String[] args) throws FileNotFoundException, IOException
    {
        
       
        int TestCases;
     
        File f = new File("Dancing.in");
        Scanner scan = new Scanner(f);
        TestCases = scan.nextInt();
        
        int[] Googlers = new int[TestCases];
        int[] Surprises = new int[TestCases];
        int[] P = new int[TestCases];
        int[] Results = new int[TestCases];
        List<List<Integer>> Final = new ArrayList<List<Integer>>();
        
        int i=0;
        while(i<TestCases)
        {
            List<Integer>tmp = new ArrayList<Integer>();
            Googlers[i] = scan.nextInt();
            Surprises[i] = scan.nextInt();
            P[i] = scan.nextInt();
            for(int j =0;j<Googlers[i];j++)
            {
                int t = Integer.valueOf(scan.nextInt());
                tmp.add(t);
            }
            Final.add(tmp);
            i++;
        }
        
        
        
       for(int a =0;a<TestCases;a++)
       {
           boolean[] checks = new boolean[Googlers[a]];
           List<Integer>mod = new ArrayList<Integer>();
           List<List<Integer>> temp = new ArrayList<List<Integer>>();
           for(int g=0;g<Googlers[a];g++)
           {
               List<Integer>L =new ArrayList<Integer>();
               int total = Final.get(a).get(g);
               int A,B,C;
               if(P[a]!=0)
                    mod.add(total%P[a]);
               if(total%3==0)
               {
                   A = total/3;
                   B=A;
                   C=A;
               }
               else
               {
                   if((total+1)%3==0)
                   {
                       A = total/3;
                       B = A+1;
                       C = A+1;
                   }
                   else
                   {
                       A = total/3;
                       B = A;
                       C = A+1;
                   }
               }
               if(A>=P[a]||B>=P[a]||C>=P[a])
                   checks[g]=true;
               L.add(A);
               L.add(B);
               L.add(C);
               temp.add(L);
          //------------------------------------
           }
           int surp=0;
               while(surp<Surprises[a])
               {
                   int X = getLargest(mod,checks);
                   
                   int diff = P[a]-temp.get(X).get(2);
                   temp.get(X).set(2, temp.get(X).get(2)+1);
                   temp.get(X).set(1, temp.get(X).get(1)-1);
                   checks[X]=true;
                   surp++;
               }
               for(int m =0;m<temp.size();m++)
               {
                   if(temp.get(m).get(0)>=P[a]||temp.get(m).get(1)>=P[a]||temp.get(m).get(2)>=P[a])
                       Results[a]++;
               }
       }
        
       
        
        
        
   
        FileWriter fstreamm = new FileWriter("Dancing.out");
        BufferedWriter out = new BufferedWriter(fstreamm);
        for(int t=0;t<TestCases;t++)
        {
            out.write("Case #"+(t+1)+": "+Results[t]);
            if(t!=TestCases-1)
                out.newLine();
        
        }
    
        out.close();
}
}
