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

	   }
}

/**
 * Copyright 2012 Christopher Schmitz. All Rights Reserved.
 */

package com.isotopeent.codejam.lib.converters;

import com.isotopeent.codejam.lib.InputConverter;

public class DynamicMultiLineConverter implements InputConverter<Object[]> {

	private static final int MAX_PARAM_COUNT = 10;

	private IntArrayLine paramConverter;
	private InputConverter<?> converter;

	private Object[] input;
	private int lineNumber;

	public DynamicMultiLineConverter(InputConverter<?> lineConverter) {
		this(lineConverter, 0);
	}

	public DynamicMultiLineConverter(InputConverter<?> lineConverter, int paramCount) {
		this.converter = lineConverter;
		if (paramCount > 0) {
			paramConverter = new IntArrayLine(paramCount);
		} else {
			paramConverter = new IntArrayLine(new int[MAX_PARAM_COUNT]);
		}
	}

	@Override
	public boolean readLine(String data) {
		if (lineNumber == 0) {
			paramConverter.readLine(data);
			int[] params = paramConverter.generateObject();
			int count = getCount(params);
			input = new Object[count + 1];
			input[lineNumber++] = params;
		} else {
			if (!converter.readLine(data)) {
				input[lineNumber++] = converter.generateObject();
			}
		}

		if (lineNumber >= input.length){
			lineNumber = 0;
		}
		return lineNumber == 0;
	}

	@Override
	public Object[] generateObject() {
		return input;
	}

	/**
	 * default implementation, just uses first parameter value
	 */
	protected int getCount(int[] parameters) {
		return parameters[0];
	}

}
