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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		
        File file = new File("data/B-large.in");
        
        
        try {
            
        	Scanner scanner = new Scanner(file);
            
        	int numOfLines = scanner.nextInt();

        	scanner.nextLine();
        	
        	

        	
        	for (int i = 0; i < numOfLines; i++) {
        	
            	int NumOfGooglers = 0;
            	int NumOfSurprisingTriplet = 0;
            	int BestResultTreshold = 0;
            	
            	int NumOfGooglersMeetingTreshold = 0;
            	
        		// Read number of Googlers
        		NumOfGooglers = scanner.nextInt();
        		//System.out.println(NumOfGooglers);
        		
        		NumOfSurprisingTriplet = scanner.nextInt();
        		
        		BestResultTreshold  = scanner.nextInt();
        		
        		
        		int result[];
        		for (int j = 0; j < NumOfGooglers; j++) {
        			
        			int currResult = scanner.nextInt();
        			
        			if (currResult < (BestResultTreshold/3)) {
        				// No way, don't bother
        				continue;
        			}
        			
        			result = getPossibleCombinations(currResult);
//        			System.out.println("Max Not Surprising: " + result[0]);
//        			System.out.println("Max Surprising: " + result[1]);
        			
        			
        			if (result[0] >= BestResultTreshold) {
        				NumOfGooglersMeetingTreshold++;
        			} else if (result[1] >= BestResultTreshold && NumOfSurprisingTriplet > 0) {
        				NumOfGooglersMeetingTreshold++;
        				NumOfSurprisingTriplet--;
        			}
        			
        			
        		}
        		
        		
        		System.out.println("Case #" + (i+1) + ": " + NumOfGooglersMeetingTreshold);
        		
        	}
        	
        	
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
		
		
		
/*		
        int result[] = getPossibleCombinations(5);
		System.out.println("Max Not Surprising: " + result[0]);
		System.out.println("Max Surprising: " + result[1]);*/

		
	}
	
	public static int[] getPossibleCombinations(int totalScore) {
		
		
		int indivMax = (int) Math.ceil( Math.min( ((double)totalScore/3.0) , 9)) ;
		indivMax = indivMax + 1;
		
		int i = indivMax;
		int indivMin = i - 3;
		
		
		int maxValueNotSurprising = 0;
		int maxValueSurprising = 0;
		
		
		// First start with indivMax
		for (; i >= indivMin; i--) {
		
			
			int currMin = Math.max(i-2, 0);
			for (int j = i; j >= currMin; j--) {
				
				
				for (int k = j; k >= currMin; k--) {
					
					
					if (i+j+k == totalScore) {
//						System.out.print("Found: " + i + " " + j + " " + k);
						
						if (i-k == 2) {
							if (i > maxValueSurprising) maxValueSurprising = i;
//							System.out.print(" (*)");
						} else {
							if (i > maxValueNotSurprising) maxValueNotSurprising = i;
						}
						
//						System.out.println();
					}
					
				}
				
			}
		}
		
		int[] output = {maxValueNotSurprising, maxValueSurprising}; 
		return output;
		
	}

}
