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


public class B
{
	public static void main(String args[]) throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(br.readLine());
		String[] line;
		int N,S,p;
		int[][] tuple = new int[1000][3];
		int[][] stuple = new int[1000][3];
		int count = 0;
		int scount = 0;

		for(int i=10;i>=0;i--)
		{
			for(int j=i-2;j<=i+2;j++)
			{
				if(j<0 || j>10) continue;
				for(int k=i-2;k<=i+2;k++)
				{
					if(k<0 || k>10) continue;
					if(j-k >2 || k-j > 2)
						continue;
					int a = (i-j > 0) ? i-j : j-i;
					int b = (i-k > 0) ? i-k : k-i;
					int c = (k-j > 0) ? k-j : j-k;

					if(a==2 || b==2 || c==2)
					{
						stuple[scount][0] = i;
						stuple[scount][1] = j;
						stuple[scount++][2] = k;
						continue;
					}
					tuple[count][0] = i;
					tuple[count][1] = j;
					tuple[count++][2] = k;
				}
			}
		}
			

		for(int i=1;i<=T;i++)
		{
			line = br.readLine().split("\\W+");
			N = Integer.parseInt(line[0]);
			S = Integer.parseInt(line[1]);
			p = Integer.parseInt(line[2]);
			int[] score = new int[N];

			for(int j=0;j<N;j++)
				score[j] = Integer.parseInt(line[3+j]);

			int ret = 0;
			for(int j=0;j<N;j++)
			{
				boolean found = false;

				for(int k=0;k<count;k++)
				{
					if((tuple[k][0] + tuple[k][1] + tuple[k][2]) == score[j])
					{
						if(tuple[k][0] >= p || tuple[k][1] >= p || tuple[k][2] >= p)
						{
							found = true;
							ret++;
							break;
						}
					}
				}
				if(!found && S!=0)
				{
					for(int k=0;k<scount;k++)
					{
						if((stuple[k][0] + stuple[k][1] + stuple[k][2]) == score[j])
						{
							if(stuple[k][0] >= p || stuple[k][1] >= p || stuple[k][2] >= p)
							{
								found = true;
								S--;
								ret++;
								break;
							}
						}
					}
				}
			}

			System.out.println("Case #"+i+": "+ret);
		}
	}
}
