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.util.ArrayList;
import java.util.List;

public class ProblemSample implements Problem {

    private int solution;

    private int googlers;

    private int surprises;

    private int note;

    private List<Integer> sums = new ArrayList<Integer>();

    @Override
    public void solve() {

        int resultat = 0;

        for (int i = 0; i < sums.size(); i++) {

            if (note == 0) {
                // Ils ont tous eu au moins 0...
                resultat = this.googlers;
            } else if (note == 1) {
                // Tous ceux qui ont eu au moins 1 ont eu au moins la note de 1.
                if (sums.get(i) >= 1) {
                    resultat++;
                }
            } else {
                if ((sums.get(i) == 3 * note - 4 || sums.get(i) == 3 * note - 3) && sums.get(i) > note) {
                    // S'ils sont tout juste, ils ont utilisÃ© une surprise.
                    surprises--;
                    // Et on les compte que si il restait des surprises Ã  consommer
                    if (surprises >= 0) {
                        resultat++;
                    }
                }
                if (sums.get(i) >= 3 * note - 2 && sums.get(i) > note) {
                    // Ok sans surprise.
                    resultat++;
                }
            }
        }
        this.setSolution(resultat);
    }

    @Override
    public void print() {
        System.out.println(googlers + " " + surprises + " " + note + " " + sums.toString());
    }

    @Override
    public Object getSolution() {
        return solution;
    }

    public void setSolution(int solution) {
        this.solution = solution;
    }

    public int getGooglers() {
        return googlers;
    }

    public int getSurprises() {
        return surprises;
    }

    public int getNote() {
        return note;
    }

    public List<Integer> getSums() {
        return sums;
    }

    public void setGooglers(int googlers) {
        this.googlers = googlers;
    }

    public void setSurprises(int surprises) {
        this.surprises = surprises;
    }

    public void setNote(int note) {
        this.note = note;
    }

    public void setSums(List<Integer> sums) {
        this.sums = sums;
    }

}