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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;

/**
 *
 * @author Wouter
 */
public class DancingWithTheGooglers {

    ArrayList<String> cases = new ArrayList<String>();
    int makesit = 0;
    int needsSurp = 0;

    public DancingWithTheGooglers() {






        try {
            // Setup in/out
            System.setIn(new FileInputStream("C:\\GCJ\\B-large.in"));
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            BufferedWriter bw = new BufferedWriter(new FileWriter("C:\\GCJ\\B-large.out"));
            bw.flush();



            int untill = Integer.parseInt(br.readLine());

            for (int t = 1; t <= untill; t++) {

                String[] ins = br.readLine().split(" ");
                int n = Integer.parseInt(ins[0]); // number of googlers
                int s = Integer.parseInt(ins[1]); // number of surpirsing trips
                int p = Integer.parseInt(ins[2]); // min points
                int[] ti = new int[n];
                for (int i = 3; i < n + 3; i++) {
                    ti[i - 3] = Integer.parseInt(ins[i]);
                }
                for (int m = 0; m < ti.length; m++) {
                    doMath(ti[m], p);
                }

                int ans = makesit;
                if (s < needsSurp) {
                    ans += s;
                } else {
                    ans += needsSurp;
                }


                String out = "Case #" + t + ": " + ans;

                cases.add(out);
                makesit = 0;
                needsSurp = 0;

            }

            for (String s : cases) {
                System.out.println(s);
                bw.write(s);
                bw.flush();
                bw.newLine();
            }

        } catch (IOException ex) {
            System.out.println("SOMETHING WENT WRONG");
        }
    }

    public void doMath(int number, int p) {
        int start = 10;
        boolean done = false;
        while (true) {
            if (start + start + start == number) {
                if (start >= p) {
                    makesit++;
                    done = true;
                    break;
                }
                break;
            }
            if (start + start + start - 1 == number) {
                if (start >= p) {
                    makesit++;
                    done = true;
                    break;
                }
                break;
            }
            if (start + start - 1 + start - 1 == number) {
                if (start >= p) {
                    makesit++;
                    done = true;
                    break;
                }
                break;
            }
            start--;
        }
        if (!done) {
            start = 10;
            while (true) {
                if (start == 1) {
                    break;
                }
                if (start + (start - 1) + (start - 2) == number) {
                    if (start >= p) {
                        needsSurp++;
                        break;
                    }
                    break;
                }
                if (start + (start - 2) + (start - 2) == number) {
                    if (start >= p) {
                        needsSurp++;
                        break;
                    }
                    break;
                }
                start--;

            }
        }

    }

    public static void main(String[] args) {
        new DancingWithTheGooglers();

    }
}
