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 topcoder;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 *
 * @author ahmet
 */
public class codeJam {
    
    
    public static void main(String[] args) throws FileNotFoundException, IOException
    {
        Scanner scan = new Scanner(System.in);
        
        
        int T = scan.nextInt();
        
        for(int i = 0; i < T; i++)
        {
            ArrayList<Integer> list = new ArrayList<Integer>();
            int howMany = scan.nextInt();
            int S = scan.nextInt();
            int p = scan.nextInt();
            
            for(int ii = 0; ii < howMany; ii++)
            {
                list.add(scan.nextInt());
            }
            Collections.sort(list);
            System.out.println("Case #" + (i + 1) + ": " + analiz(list, S, p));
        }  
    }
    
    public static String analiz( ArrayList <Integer> a, int S, int p)
    {
        int count = 0;
        for(int i = 0; i < a.size(); i++)
        {
            if(a.get(i)/3 >= p)
            {
                 a.set(i, -1);
                 count++;
            }
        }   
        for(int i = 0; i < a.size(); i++)
        {
            if(a.get(i) == -1)
            {
                 a.remove(i);
                 i=0;
            }
        }
        while(S >= 0 && a.size() > 0 && a.get(a.size() - 1 ) > 0)
        {
            if(a.get(a.size() - 1 )%3 == 0 )
            {
                if(a.get(a.size() - 1)/3 + 1 >= p && S != 0)
                {
                    count++;
                    S--;
                }
                else
                    break;
            }
            else if(a.get(a.size() - 1 ) % 3 == 1)
            {
                if(a.get(a.size() - 1)/3 + 1 >= p)
                {
                    count++;
                }
                else
                    break;

            }
            else if(a.get(a.size() - 1 ) % 3 == 2)
            {
                if(a.get(a.size() - 1) /3 + 1 >= p)
                {
                    count++;
                }      
                else if(a.get(a.size() - 1)/3 + 2 >= p && S != 0)
                {
                    count++;
                    S--;
                }
                else
                    break;
            }     
            a.remove(a.size() - 1 );            
        }
        
        return "" + count;
    }
    
}
