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 qualification.Dancing;

import java.util.*;

/**
 *
 * @author farshid
 */
public class Dancing {

    public Dancing() {
    }

    public int solve(String problem) {
        String[] arr = problem.split(" ");

        int n = Integer.parseInt(arr[0]);
        int s = Integer.parseInt(arr[1]);
        int p = Integer.parseInt(arr[2]);
        int[] scores = new int[arr.length - 3];

        for (int i = 3; i < arr.length; i++) {
            scores[i - 3] = Integer.parseInt(arr[i]);
        }

        LinkedList<LinkedList<Combination>> combs =
                new LinkedList<LinkedList<Combination>>();

        for (int i = 0; i < scores.length; i++) {
            LinkedList<Combination> l = this.dancerPossibleCombs(scores[i], p);
            combs.add(l);
        }

        int max = this.processCombination(combs, s);

        return max;
    }

    public void test() {
    
    }

    private int processCombination(LinkedList<LinkedList<Combination>> combs, int maxSur) {

        int max = 0;
        int currentSur = 0;

        for (int i = 0; i < combs.size(); i++) {
            LinkedList<Combination> current = combs.get(i);
            boolean increased = false;
            
            for (int j = 0; j < current.size(); j++) {
                if (!current.get(j).isSurprising()){
                    max++;
                    increased = true;
                    break;
                }
            }
            
            if (!increased && !current.isEmpty() && currentSur < maxSur){
                max++;
                currentSur++;
            }
        }

        return max;
    }

    private LinkedList<Combination> dancerPossibleCombs(int total, int p) {

        LinkedList<Combination> list = new LinkedList<Combination>();

        // Get all possible combs
        for (int i = 0; i <= 10; i++) {

            if ((i + 2) >= p && (3 * i) + 4 >= total) { // otherwise no possible/useful combination

                // 8 possible combs
                if (3 * i == total && i >= p) {
                    Combination c = new Combination(
                            new int[]{i, i, i}, false);
                    list.add(c);
                    continue;
                }
                if ((3 * i + 1) == total && (i + 1) >= p) {
                    Combination c = new Combination(
                            new int[]{i, i, i + 1}, false);
                    list.add(c);
                    continue;
                }

                if ((3 * i + 2) == total) {
                    if (i + 2 >= p) {
                        Combination c1 = new Combination(
                                new int[]{i, i, i + 2}, true);
                        list.add(c1);
                    }
                    if (i + 1 >= p) {
                        Combination c2 = new Combination(
                                new int[]{i, i + 1, i + 1}, false);

                        list.add(c2);
                    }

                    continue;
                }

                if (3 * i + 3 == total && (i + 2) >= p) {
                    Combination c = new Combination(
                            new int[]{i, i + 1, i + 2}, true);
                    list.add(c);
                    continue;
                }

                if (3 * i + 4 == total && (i + 2) >= p) {
                    Combination c1 = new Combination(
                            new int[]{i, i + 2, i + 2}, true);
                    list.add(c1);
                }
            }
        }

        return list;

    }
}
