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.*;

public class PracticeB
{
	/* ±±©çÒW */
	private static final String fname = "B-large.in"; // üÍpÌt@C¼
	public static void solve()
	{
		int T = sc.nextInt();
		for (int i = 1; i <= T; i++)
		{
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			
			int tp[] = new int[N];
			int cnt = 0;
			
			for (int j = 0; j < N; j++)tp[j] = sc.nextInt();
			Arrays.sort(tp);
			int[][] ti = new int[N][3];
			for (int j = ti.length - 1; j >= 0; j--)
			{
				int tv = tp[j] / 3;
				double val = tp[j] / 3.0;
				if(val - tv < 0.5)
				{
					ti[j][0] = tv;
					ti[j][1] = tv;
					ti[j][2] = tv + 1;
				}if(val - tv > 0.5)
				{
					ti[j][0] = tv;
					ti[j][1] = tv + 1;
					ti[j][2] = tv + 1;
				}if(val - tv == 0)
				{
					ti[j][0] = tv;
					ti[j][1] = tv;
					ti[j][2] = tv;
				}
//				for (int k = 0; k < 3; k++) System.out.print(ti[j][k] + " ");
//				System.out.println();
				if(ti[j][2] >= p)
				{
					cnt++;
					continue;
				}
				if(val - tv < 0.5)
				{
					ti[j][0] = tv - 1;
					ti[j][1] = tv + 1;
					ti[j][2] = tv + 1;
					if(ti[j][2] > 10 || ti[j][0] < 0)
					{
						ti[j][0]++;
						ti[j][2]--;
					}
				}if(val - tv > 0.5)
				{
					ti[j][0] = tv;
					ti[j][1] = tv;
					ti[j][2] = tv + 2;
					while(ti[j][2] > 10 || ti[j][0] < 0)
					{
						ti[j][0] = tv++;
						ti[j][2] = tv--;
					}
				}if(val - tv == 0)
				{
					ti[j][0] = tv - 1;
					ti[j][1] = tv;
					ti[j][2] = tv + 1;
					if(ti[j][2] > 10 || ti[j][0] < 0)
					{
						ti[j][0]++;
						ti[j][2]--;
					}
				}
				if(S > 0 && ti[j][2] >= p)
				{
					cnt++;
					S--;
				}
			}
//			System.
			out.println("Case #" + i + ": " + cnt);
		}
	}
	/* ±±ÜÅ */

	private static Scanner sc;
	private static PrintWriter out;
	public static void main(String args[])
	{
		try
		{
			sc = new Scanner(new File(fname));
//			sc = new Scanner(System.in);
			out = new PrintWriter(new BufferedWriter(new FileWriter(new File(fname + "_out.dat"))));
		} catch (Exception e)
		{
			e.printStackTrace();
		}
		solve();
		out.close();
	}

}
