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

	   }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class dancing {
    public static void main(String[] args)
    {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int T;
        String input;
        try {
            input = reader.readLine();
            T  = Integer.parseInt(input);
            int counter = 1;
            while (T-->0)
            {
                int N,S,P;
                List<Integer> scores = new ArrayList<Integer>();
                Map<Integer,Integer> frequency = new HashMap<Integer,Integer>();
                for(int i=0;i<31;i++)
                {
                    frequency.put(i,0);
                }
                input = reader.readLine();
                String[] in = input.split(" ");
                N = Integer.parseInt(in[0]);
                S= Integer.parseInt(in[1]);
                P=Integer.parseInt(in[2]);
                int count = 3;
                while(count<N+3)
                {
                    int num = Integer.parseInt(in[count]);
                    scores.add(num);
                    frequency.put(num,frequency.get(num)+1);
                    count++;
                }
                int upperbound;
                if(P>=1)
                {
                    upperbound = P+2*(P-1);
                }
                else
                {
                    upperbound = 0;
                }
                int lowerBound;
                if(P>=2)
                {
                    lowerBound = P+2*(P-2);
                }
                else
                {
                        lowerBound =-1;
                }
                int sure = 0;
                List<Integer> possibleScores = new ArrayList<Integer>(frequency.keySet());
                Collections.sort(possibleScores);
                for(int i=upperbound;i<31;i++)
                {
                    sure += frequency.get(i);
                }
                int maxPossibleSurprises=0;
                if(lowerBound != -1)
                {
                    for(int i=lowerBound;i<upperbound;i++)
                    {
                        maxPossibleSurprises += frequency.get(i);
                    }
                }
                int actualNumber = Math.min(maxPossibleSurprises,S);
                int ans = actualNumber +sure;
                System.out.println("Case #"+counter+": "+ans);
                counter++;
            }
        } catch (IOException e) {
            e.printStackTrace();  //To change body of catch statement use File | Settings | File Templates.
        }
    }
}
