import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.util.*;

class Dancing
{

	public static void main(String[] args)
	{
		int[] dancers = new int[100];
		int N;
		int surprising;
		int target;
		int i;
		int result;
		int optimal;
		int n;
		int T;
		int t;
		Scanner myInput = new Scanner(System.in);
		T = myInput.nextInt();
		for (t=1; t<=T; t++)
		{
			result=0;
			N = myInput.nextInt();
			surprising = myInput.nextInt();
			target = myInput.nextInt();
			for (i=0; i<N; i++)
				dancers[i] = myInput.nextInt();
			Arrays.sort(dancers,0,N);
			for (i=N-1; i>=0; i--)
			{
				optimal = 0;
				n=dancers[i];
				//System.out.println(n);
				if (surprising>0)
				{
					if (n%3==0) 
					{
						optimal=n/3;
						if (((optimal-1>=0)&&(optimal<target)) && (optimal+1>=target))
						{
							optimal++;
							surprising--;
						}
					}
					else
						if (n%3==1)
						{
							optimal=(n/3)+1;
						}
						else
							if (n%3==2)
							{
								optimal=(n/3)+1;
								if ((optimal<target) && (optimal+1>=target))
								{
									optimal++;
									surprising--;
								}
							}

					if (optimal>=target) result++;

				}
				else
				{
					if (n%3==0) optimal=n/3;
					else
						optimal = (n/3)+1;
					if (optimal>=target) result++;
				}
			}
			System.out.println("Case #"+t+": "+result);
		}
	}

}
