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


public class Blank {
	public static int cases = 0;

	public static void main(String args[]) {
		File input = new File("Input.txt");
		File output = new File("Output.txt");
		saveGame(output, convertString(loadGame(input)));
	}

	public static String[] loadGame(File input){
		Scanner in;
		try {
			in = new Scanner(input);
			String[] output = new String[30];
			cases = in.nextInt();
			in.nextLine();
			for(int i = 0; i < cases; i++){
				output[i] = in.nextLine().toLowerCase();
			}
			in.close();
			return output;
		}
		catch (StringIndexOutOfBoundsException e) { 
		}
		catch (FileNotFoundException e) { 
		}
		catch (NoSuchElementException e) { 
		} 
		catch (NullPointerException e) { }
		return null;
	}

	public static void saveGame(File name, String[] output){
		PrintWriter out;
		try {
			out = new PrintWriter(name);
			for(int i = 1; i <= cases; i++){
				out.println("Case #" + i + ": " + output[(i-1)]);
			}  
			out.close();
		}
		catch (FileNotFoundException e) {

		}
		catch (NullPointerException e) {

		}
	}

	public static String[] convertString(String[] output){
		String[] returnString = new String[30];
		for(int i = 0; i < cases; i++){
			returnString[i] = Character.toString(convert(output[i].charAt(0)));
			for(int j = 1; j < output[i].length(); j++){
				returnString[i] += convert(output[i].charAt(j));
			}
		}
		return returnString;
	}

	public static char convert(char letter){
		char returnLetter;
		switch (letter) {
		case 'a':  returnLetter = 'y';
		break;
		case 'b':  returnLetter = 'h';
		break;
		case 'c':  returnLetter = 'e';
		break;
		case 'd':  returnLetter = 's';
		break;
		case 'e':  returnLetter = 'o';
		break;
		case 'f':  returnLetter = 'c';
		break;
		case 'g':  returnLetter = 'v';
		break;
		case 'h':  returnLetter = 'x';
		break;
		case 'i':  returnLetter = 'd';
		break;
		case 'j':  returnLetter = 'u';
		break;
		case 'k':  returnLetter = 'i';
		break;
		case 'l':  returnLetter = 'g';
		break;
		case 'm':  returnLetter = 'l';
		break;
		case 'n':  returnLetter = 'b';
		break;
		case 'o':  returnLetter = 'k';
		break;
		case 'p':  returnLetter = 'r';
		break;
		case 'q':  returnLetter = 'z';
		break;
		case 'r':  returnLetter = 't';
		break;
		case 's':  returnLetter = 'n';
		break;
		case 't':  returnLetter = 'w';
		break;
		case 'u':  returnLetter = 'j';
		break;
		case 'v':  returnLetter = 'p';
		break;
		case 'w':  returnLetter = 'f';
		break;
		case 'x':  returnLetter = 'm';
		break;
		case 'y':  returnLetter = 'a';
		break;
		case 'z':  returnLetter = 'q';
		break;
		default: returnLetter = ' ';
		break;
		}
		return returnLetter;
	}

}
