import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * 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. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

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