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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

/**
 * @author Jaffar Ramay
 *
 */
public class DancingWithTheGooglers {

	public static int[] giveBreakDown(int number, int maxScore, boolean getSurprising){
		
		int[] array = null;
		outer: for (int i = 0; i <= 10; i++) {
			for (int j = 0; j <= 10; j++) {
				for (int k = 0; k <= 10; k++) {
					if(number==(i+j+k)){
						
						if((i-j>2 || i-k>2 || j-i>2 || j-k>2 || k-i>2 || k-j>2)){
							continue;
						}else if(i>=maxScore || j>=maxScore || k>=maxScore){
							if((i-j==2 || i-k==2 || j-i==2 || j-k==2 || k-i==2 || k-j==2)){
								if(getSurprising){
									array = new int[3];
									array[0] = i;
									array[1] = j;
									array[2] = k;
									break outer;
								}
							}else if(!getSurprising){
								array = new int[3];
								array[0] = i;
								array[1] = j;
								array[2] = k;
								break outer;
								
							}
						}
					}
					 
					
				}
			}
			
		}
		return array;
		
	}
	
	public static void solve() throws IOException {
		BufferedReader reader = new BufferedReader(new FileReader(new File("/Users/jaffar_ramay/Workspaces/eclipseWorkspace/Revision/src/codejam2012/qualification/DancingWithTheGooglers.in")));
		BufferedWriter writer = new BufferedWriter(new FileWriter(new File("/Users/jaffar_ramay/Workspaces/eclipseWorkspace/Revision/src/codejam2012/qualification/DancingWithTheGooglers.out")));
		StringBuffer output;
		String line = null;
		while((line=reader.readLine())!=null){
			int testCases = Integer.parseInt(line);
			for (int i = 1; i <= testCases; i++) {
			     String[] testCase = reader.readLine().split(" ");
			     int NumberOfGooglers = Integer.parseInt(testCase[0]);
			     int SurprisingTripplets = Integer.parseInt(testCase[1]);
			     int BestResultP = Integer.parseInt(testCase[2]);
			     int gotAtleastBestScore = 0;
			     for (int j = 0; j < NumberOfGooglers; j++) {
					int scoreByJudges = Integer.parseInt(testCase[j+3]);
					int[]  array = null;
					
					array = giveBreakDown(scoreByJudges,BestResultP,false);
					if(array==null){
						if(SurprisingTripplets>0){
							array = giveBreakDown(scoreByJudges,BestResultP,true);
							if(array!=null)
								SurprisingTripplets--;
						}	
					}
					if(array==null){
						array = giveBreakDown(scoreByJudges,-1,false);	
					}
					if(array==null){
						if(SurprisingTripplets>0){
							array = giveBreakDown(scoreByJudges,-1,true);
							if(array!=null)
								SurprisingTripplets--;
						}	
					}
					if(array[0]>=BestResultP||array[1]>=BestResultP||array[2]>=BestResultP){
						gotAtleastBestScore++;
					}
				}
			    
			    writer.write("Case #"+i+": "+gotAtleastBestScore);
			    if(i<testCases)
			    	writer.newLine();
			
			}
		}
		reader.close();
		writer.close();
	}
	
	public static void main(String[] args) throws IOException {
		solve();
	}
}
