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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import static java.lang.Math.abs;

public class B {

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new FileReader("input.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("output"));

		int T = in.nextInt();

		int n, s, p;
		for (int i = 1; i <= T; i++) {
			// read input
			n = in.nextInt(); s = in.nextInt();	p = in.nextInt();
			int[] googlers = new int[n];
			for (int j = 0; j < n; j++)
				googlers[j] = in.nextInt();

			// solve
			int ans = solve(n, s, p, googlers);
			bw.write("Case #" + i + ": " + ans);
			bw.newLine();
		}
		
		bw.close();
		System.out.println("end");
	}

	private static int solve(int n, int s, int p, int[] googlers) throws IOException {
		boolean[] surp = new boolean[n];
		boolean[] reach = new boolean[n];
		boolean[] both = new boolean[n];
		
		for (int T = 0; T < n; T++)
			for (int i = 0; i <= 10; i++)
				for (int j = i; j <= i+2 && j <= 10; j++)
					for (int k = j; k <= j+2 && j <= 10; k++)
						if (i+j+k == googlers[T] && check(i, j, k))
						{
							boolean a = isSurprising(i, j, k), b = reached(i, j, k, p);
							if(!surp[T]) surp[T] = a && !b;
							if(!reach[T]) reach[T] = b && !a;
							if(!both[T]) both[T] = a && b; 
						}
		
		int max = findMax(n, s, p, surp, reach, both);
		
		return max;
	}

	private static int findMax(int n, int s, int p, boolean[] surp,	boolean[] reach, boolean[] both) {
		
		int max = 0;
		for(int i = 0; i < n; i++)
			if(both[i] || reach[i])max++;
		
		int ss = 0;
		for(int i = 0; i < n; i++)
			if(surp[i] || both[i]) ss++;
		
		if(ss == s)
			return max;
		else // ss > s
		{
			for(int i = 0; i < n; i++)
				if(surp[i] || (both[i] && reach[i])) ss--;
			
			if(ss <= s)
				return max;
			else
				return max-(ss-s);
			
		}
	}

	private static boolean reached(int i, int j, int k, int p) {
		return Math.max(i, Math.max(j, k)) >= p;
	}

	private static boolean isSurprising(int i, int j, int k) {
		return abs(i - j) == 2 || abs(j - k) == 2 || abs(i - k) == 2;
	}

	private static boolean check(int i, int j, int k) {
		return abs(i - j) <= 2 && abs(j - k) <= 2 && abs(i - k) <= 2;
	}
}
