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.FileReader;
import java.io.FileWriter;
import java.io.Writer;
import java.util.HashSet;
import java.util.Set;


public class q2 {
	
	static int n = 0, s = 0, p = 0;
	static int t[];
	
	public static void main(String args[]) throws Exception {
		String path = "./src/";
		String ifile = path + "B-large.in";
		String ofile = path + "B-large.out";
		int i = 0, j = 0;
		
		

		
		
		BufferedReader in = new BufferedReader(new FileReader(ifile));
		StringBuilder os = new StringBuilder();

		
		
		String line = null;
		int ln = 0;
		
		in.readLine();
		
		while ((line = in.readLine()) != null) {
			String vs[] = line.split(" ");
			
			n = Integer.parseInt(vs[0]);
			s = Integer.parseInt(vs[1]);
			p = Integer.parseInt(vs[2]);
			
			t = new int[vs.length - 3];
			for (i = 0; i + 3< vs.length; ++i)
				t[i] = Integer.parseInt(vs[i+3]);
			
			++ln;
			os.append(String.format("Case #%d: %d", ln, max()));
			os.append('\n');
		}
		
		in.close();
		
		
		Writer out = new BufferedWriter(new FileWriter(ofile));
		out.write(os.toString());
		out.close();
	}
	
	static int max() {
//		Set<Integer> csp = new HashSet<Integer>();
//		Set<Integer> csc = new HashSet<Integer>();
		
		int max = 0;
		int i = 0,j = 0;
		
		int ipn = 0;
		int pn = 0;
		int cn = 0;
		
		int min_p;
		int max_p;
		
		if (p == 1) {
			min_p = 1;
			max_p = 0;
		}	
		else {
			min_p = p * 3 - 4;
			max_p = (p - 1) * 3;
		} 
		
		for (i = 0; i < t.length; ++i) {

			
			if (t[i] < min_p)
				++ipn;
			else if (t[i] > max_p)
				++cn;
			else
				++pn;
			
//			a += ((t[i] % 3) == 2) ? 2 : 1;
//
//			if ( a > p )
//				cs.add(new Integer(t[i]));
		}

		if (s <= pn)
			max = s + cn;
		else if (s > pn)
			max = pn + cn;
		
		
		return max;
	}
	
}

