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.Scanner;
import java.util.Arrays;
import java.lang.StringBuilder;


public class B{
		//STAES3307


	public static void main(String[] args){
		//get the char value of 'a', use that to index into the letters array when replacing characters
		try{
			//BufferedReader reader = new BufferedReader(new FileReader(new File("A-small-attempt0.in")));
			Scanner scan = new Scanner(new File("B-large.in"));
			BufferedWriter writer = new BufferedWriter(new FileWriter(new File("B.out")));
			int lines = scan.nextInt();
			for(int i = 0; i < lines; i++){
				//System.out.println("Case " + i);
				int t = scan.nextInt();
				int s = scan.nextInt();
				int s_used = 0;
				int p = scan.nextInt();
				int[] scores = new int[t];
				int count = 0;
				for(int j = 0; j < t; j++){
					scores[j] = scan.nextInt();
				}
				Arrays.sort(scores);
				for(int j = t-1; j >= 0; j--){
					int score = scores[j];
					int maxPos = (int)Math.ceil(score/3) + 2;
					//System.out.println(score + " " + maxPos);
					// cases...list probably doesn't contain everything...
					// not cleanest approach...obviously
					
					
					if(maxPos - 2 >= p){
						if(3*maxPos == score || ((maxPos - 1 >= 0) && ((2*maxPos + (maxPos - 1)) == score || (maxPos + 2*(maxPos - 1)) == score || 3*(maxPos - 1) == score || ((maxPos - 2 >= 0) && ((2*(maxPos - 1) + (maxPos - 2)) == score || ((maxPos - 1) + 2*(maxPos - 2)) == score || 3*(maxPos -2) == score || (2*(maxPos - 2) + (maxPos - 3)) == score))))) count++;
						else if(s_used < s){
							// score can be "surprising"
							if((maxPos - 2 >= 0) && ((maxPos + (maxPos - 1) + (maxPos - 2)) == score || (maxPos + 2*(maxPos - 2)) == score || ((maxPos - 3 >= 0) && (((maxPos - 1) + 2*(maxPos - 3)) == score || (2*(maxPos - 1) + (maxPos - 3)) == score || ((maxPos - 1) + (maxPos - 2) + (maxPos - 3)) == score)))){
								count++;
								s_used++;
							}
						
						}
					}else if(maxPos - 1 >= p){
						if(3*maxPos == score || ((maxPos - 1 >= 0) && ((2*maxPos + (maxPos - 1)) == score || (maxPos + 2*(maxPos - 1)) == score || 3*(maxPos - 1) == score || ((maxPos - 2 >= 0) && ((2*(maxPos - 1) + (maxPos - 2)) == score || ((maxPos - 1) + 2*(maxPos - 2)) == score))))) count++;
						else if(s_used < s){
							// score can be "surprising"
							if((maxPos - 2 >= 0) && ((maxPos + (maxPos - 1) + (maxPos - 2)) == score || (maxPos + 2*(maxPos - 2)) == score || ((maxPos - 3 >= 0) && (((maxPos - 1) + 2*(maxPos - 3)) == score || (2*(maxPos - 1) + (maxPos - 3)) == score || ((maxPos - 1) + (maxPos - 2) + (maxPos - 3)) == score)))){
								count++;
								s_used++;
							}
						
						}
						/*if(3*maxPos == score || (2*maxPos + (maxPos - 1)) == score || (maxPos + 2*(maxPos - 1)) == score || 3*(maxPos - 1) == score || (2*(maxPos - 1) + (maxPos - 2)) == score || ((maxPos - 1) + 2*(maxPos - 2)) == score) count++;
						else if(s_used < s){
							// score can be "surprising"
							if((maxPos + (maxPos - 1) + (maxPos - 2)) == score || (maxPos + 2*(maxPos - 2)) == score || ((maxPos - 1) + 2*(maxPos - 3)) == score || (2*(maxPos - 1) + (maxPos - 3)) == score || ((maxPos - 1) + (maxPos - 2) + (maxPos - 3)) == score){
								count++;
								s_used++;
							}
						
						}*/
					}else if(maxPos >= p){
						if(3*maxPos == score || ((maxPos - 1 >= 0) && ((2*maxPos + (maxPos - 1)) == score || (maxPos + 2*(maxPos - 1)) == score))) count++;
						else if(s_used < s){
							// score can be "surprising"
							if((maxPos - 2 >= 0) && ((maxPos + (maxPos - 1) + (maxPos - 2)) == score || (maxPos + 2*(maxPos - 2)) == score)){
								count++;
								s_used++;
							}
						
						}
						/*if(3*maxPos == score || (2*maxPos + (maxPos - 1)) == score || (maxPos + 2*(maxPos - 1)) == score) count++;
						else if(s_used < s){
							// score can be "surprising"
							if((maxPos + (maxPos - 1) + (maxPos - 2)) == score || (maxPos + 2*(maxPos - 2)) == score){
								count++;
								s_used++;
							}
						
						}*/
					}
					
				}
				writer.write("Case #" + (i+1) + ": " + count + "\n");
					
			}
			writer.close();
		}catch(Exception e){e.printStackTrace();}	


	}


}
