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

	   }
}

/**
 * 
 */
package asem.googe.codejam.qround;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

/**
 * @author A.Alathwari
 * 
 * Problem A : 
 *
 */
public class ProblemA implements Runnable {
	
	asem.core.util.InputReader fin;
	java.io.PrintWriter fout;

	/**
	 * @param fin
	 * @param fout
	 */
	public ProblemA(asem.core.util.InputReader fin, PrintWriter fout) {
		this.fin = fin;
		this.fout = fout;
	}
	
	/**
	 * @param fin
	 * @param fout
	 * @throws IOException 
	 * @throws FileNotFoundException 
	 */
	public ProblemA(String fin, String fout) throws FileNotFoundException, IOException {
		this.fin  = new asem.core.util.InputReader(new FileReader(fin));
		this.fout = new PrintWriter(System.out);
	}

	/* (non-Javadoc)
	 * @see java.lang.Runnable#run()
	 */
	@Override
	public void run() {
		// TODO Auto-generated method stub
		try {
			
			String ciphertext1 = new String("ejp mysljylc kd kxveddknmc re jsicpdrysi");
			String ciphertext2 = new String("rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd");
			String ciphertext3 = new String("de kr kd eoya kw aej tysr re ujdr lkgc jv qz");
			String plaintext1 = new String("our language is impossible to understand");
			String plaintext2 = new String("there are twenty six factorial possibilities");
			String plaintext3 = new String("so it is okay if you want to just give up zq");
			
			String code = new String("abcdefghijklmnopqrstuvwxyz");
			String code2 = new String();
			
			char ch = ' ';
			for (int i = 0; i < 26; i++) {
				ch = code.charAt(i);
				
				if (plaintext1.indexOf(ch) >= 0)
					code2 += ciphertext1.charAt(plaintext1.indexOf(ch));
				else if (plaintext2.indexOf(ch) >= 0)
					code2 += ciphertext2.charAt(plaintext2.indexOf(ch));
				else if (plaintext3.indexOf(ch) >= 0)
					code2 += ciphertext3.charAt(plaintext3.indexOf(ch));
				else
					code2 += ch;
			}
			
			
			for (int tNum = 1, inT = fin.readInt(); tNum <= inT; tNum++) {
				
				String ciphertext = fin.readLine(true);
				String plaintext = new String();
				
				for (int i = 0; i < ciphertext.length(); i++)
					if (code2.indexOf(ciphertext.charAt(i)) >= 0)
						plaintext += code.charAt(code2.indexOf(ciphertext.charAt(i)));
					else if (ciphertext.charAt(i) == ' ')
						plaintext += ciphertext.charAt(i);
				
				System.out.println("Case #" + tNum + ": " + plaintext);
				
			}
			
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}