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.
 */

import java.util.Scanner;

/**
 *
 * @author leonardo
 */
public class Dance {
    
    static boolean canBeSurprising(int x1, int x2, int x3) {                
        if (x1 > 10 || x2 > 10 || x3 > 10)
            return false ;
        
        return (Math.abs(x1 -x2) >= 2) || (Math.abs(x1 -x3) >= 2) || (Math.abs(x2 -x3) >= 2) ;
    }
    
    /*static boolean canBeSurprising(int r, int x, int p) {                
        boolean[] res = new boolean[2] ;
        
        if (r == 0) {
            return canBeSurprising(x, x, x) || canBeSurprising(x-1, x+1, x) ;           
        }        
        else if (r == 1) {
            return canBeSurprising(x+1, x, x, p, res) || canBeSurprising(x+1, x+1, x-1) ;
        }
        else {
            canBeSurprising(x+2, x, x, p, res);
            canBeSurprising(x, x+1, x+1, p, res) ;        
        }
        return (! res[0] && res[1]) ? 1 : 0;
    }*/

    public static void main(String[] args) {               
        Scanner scanner = new Scanner(System.in) ;
        int inputSize = Integer.parseInt(scanner.nextLine()) ;
                
        for(int i = 1; i <= inputSize; i++) {
            String[] numbers = scanner.nextLine().split(" ") ;
                    
            int n = Integer.parseInt(numbers[0]) ;
            int s = Integer.parseInt(numbers[1]) ;
            int p = Integer.parseInt(numbers[2]) ;
            
            int count = 0 ;
            for(int googler = 0; googler < n; googler++) {
                int score = Integer.parseInt(numbers[googler + 3]) ;
                
                int r = score % 3 ;
                int x = score / 3 ;
                
                if (r == 0) {
                    
                    // possible maxs: x and x + 1
                    
                    if (x >= p)
                        count++ ;
                    else if ((score > 0) && s > 0 && (x + 1) >= p) {
                        s-- ;
                        count++ ;
                    }
                        
                }
                
                // r == 1 -> max = x + 1
                else if (r == 1 && (x + 1 >= p))
                    count++ ;
                
                else {
                                        
                   // possible maxs: x + 1 and x + 2 
                    
                   if ((x + 1) >= p)
                        count++ ;
                   else if ((x+2 <= 10) && (x+2 >= p) && (s > 0)) {
                        count++ ;
                        s-- ;
                    }
                }
            }
            System.out.println("Case #" + i + ": " + count) ;
        }                
    }
}

