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

	   }
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package cjam;
import java.io.*;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
 *
 * @author Administrator
 */
public class Cjam {

    /**
     * @param args the command line arguments
     */

    public  BufferedWriter output;
    public Scanner input;
    public int T;
    
    
    
     public Cjam()
        {
            
            
               try {
                            input = new Scanner(new FileReader("B-large.in")); 
                           output = new BufferedWriter(new FileWriter(new File("blar.out")));
                     } 
               catch (IOException ex) {
                          Logger.getLogger(Cjam.class.getName()).log(Level.SEVERE, null, ex);
                      }
                      
               T = input.nextInt();       
               
        }
    
    
    
    
    
    
    public static void main(String[] args) {
        // TODO code application logic here
       
        Cjam c = new Cjam();
        
        
       for(int i = 1; i <= c.T ; i++)
       {
           int N,S,p,ti[],b1,b2;
           int max1=0,max2=0,max3=0,max=0;
           
           N = c.input.nextInt();
           S = c.input.nextInt();
           p = c.input.nextInt();
           ti = new int[N];
           
           for(int j=0 ; j < N ; j++)
           {
               ti[j] = c.input.nextInt();
           }
           
           if(p > 1)
           {
                   b1 = 3*(p-1) - 1;
                   b2 = 3*(p-1) ;
                   
                   for(int k = 0 ; k < N ; k++ )
                   {
                       if( ti[k] > b2 )
                       {
                           max1++;
                       }
                               
                       else if( (ti[k]==b1) || (ti[k]==b2) )
                       {
                           max2++;
                       }
                       
                   }
                   
                   
                   
              if( max2 > S )
              {
                  max = max1 + S;
              }
              else
              {
                  max = max1 + max2;
              }
           
              
              
           }
           else if(p==1)
           {
               for(int k = 0 ; k < N ; k++ )
                   {
                      if(ti[k] >= 1)
                      {
                          max1++;
                      }
                      
                      max= max1;
                      
                   }
           }
           else if(p==0)
           {
               max = N;
           }
           
           
           
           
           
            try {
                c.output.append("Case #"+i+": "+max);
                
                
                if(i != c.T)  c.output.newLine();
            } catch (IOException ex) {
                Logger.getLogger(Cjam.class.getName()).log(Level.SEVERE, null, ex);
            }
           
           
 
       
       
       }
        try {
            c.output.close();
        } catch (IOException ex) {
            Logger.getLogger(Cjam.class.getName()).log(Level.SEVERE, null, ex);
        }
     c.input.close();
       
       
    }
}
