package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

import java.io.*;
import java.util.*;

public class ProblemB
{
	public static void main(String[] args)
	{
		String txtfile="B-large.in";
		try
		{
			Scanner scan = new Scanner(new FileInputStream(txtfile));
			FileWriter fstream = new FileWriter("B-large.out");
			BufferedWriter out = new BufferedWriter(fstream);
			int T = scan.nextInt();
			int N,S,p;
			int[] t ;
			int max=0;

			for (int X=1;X<=T;X++)
			{
				max = 0;
				N = scan.nextInt();
				S = scan.nextInt();
				p = scan.nextInt();
				t = new int[N];
				for (int i=0;i<N;i++)
				{
					t[i] = scan.nextInt();
				}

				Arrays.sort(t);
				int a,b;
				for (int i=N-1;i>=0;i--)
				{
					a = t[i] / 3;
					b = t[i] % 3;
					if (a>=p)
						max++;
					else if (p-a<=2)
					{
						if (b>0) a++;
						if (a<p && t[i]>0)
						{
							if (p-a==1 && b==0 && S>0)
							{
								a++;
								S--;
							}
							else if (b==2 && S>0)
							{
								a++;
								S--;
							}
						}
						if (a>=p) max++;

					}
				}
				out.write("Case #" + X + ": " + max + "\n");
			}
			out.close();
		}
		catch (Exception ex)
		{
			System.out.println(ex);
			System.exit(1);
		}

	}
}