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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dance {
	
	public static void main(String[] args) {
		BufferedReader reader = null;
		BufferedWriter writer = null;
		try {
            
			if (args.length == 0) {             
				System.out.println("Usage Dance <input_file>");
				System.exit(0);
			}
			
			File inputFile = new File(args[0]);

            if (!inputFile.exists())
            	System.out.println(String.format("File {0} not found in the current directory", args[0]));
            
     
            
			FileReader fileReader = new FileReader(inputFile.getAbsolutePath());
			reader = new BufferedReader(fileReader);
			FileWriter fileWriter = new FileWriter("Output.txt");
			writer = new BufferedWriter(fileWriter);
			String line = reader.readLine();			
			int numberOfTestCases = Integer.parseInt(line);
			for (int i = 0; i < numberOfTestCases; i++) {
				line = reader.readLine();
				String[] tokens = line.split(" ");
				int N = Integer.parseInt(tokens[0]);
				int S = Integer.parseInt(tokens[1]);
				int P = Integer.parseInt(tokens[2]);
				int[] totalScores = new int[N]; 
				for (int j = 3; j < tokens.length; j++) {
					totalScores[j - 3] = Integer.parseInt(tokens[j]);
				}
				writer.write("Case #" + (i + 1) + ": " + maxWithScoreGreaterThanP(P,S,totalScores));
				writer.newLine();
			}
						
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
			if (reader!=null) {
				reader.close();
			}
			if (writer!=null) {
				writer.close();
			}
			} catch(Exception e) {}
		}		
	}

	private static int maxWithScoreGreaterThanP(int p, int s, int[] totalScores) {
		int count = 0;
		int remainingSurprises = s;
		for (int i = 0; i < totalScores.length; i++) {
			boolean found = false;
			int required = totalScores[i];
			for (int x=p; x<=10 && !found;x++) {
				for (int y = x; y >= x - 2 && y>= 0 && !found;y--) {
					for (int z = x; z >= y && z >=0 ;z--) {				
						if (x + y + z == required ) {
							int min = Math.min(y, z);
							if (min == x - 2 && remainingSurprises > 0){
								found = true;
								count++;
								remainingSurprises--;
								break;
							} else if (min > x-2) {
								found = true;
								count++;
								break;
							}						
						}
					}
				}
			}
		}
		return count;
	}
	
	


}
