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.util.*;
import java.io.*;

class B1small
{
	public static void main(String[] args) throws Exception 
	{
		FileInputStream fis = new FileInputStream("B-large.in");
		Scanner scan = new Scanner(fis);
		FileWriter fw = new FileWriter("output.txt");
		int T = scan.nextInt();
		for(int i=1;i<=T;i++)
		{
			int count=0;
			int sur =0;
			int N = scan.nextInt();//number of dancers
			int S = scan.nextInt();//number of surprises
			int P = scan.nextInt();//best result
			for(int j=0;j<N;j++)
			{
				int t = scan.nextInt();
				if(t == 0 && P !=0)
					continue;
				if(t%3==2 || t%3==1)
				{	if(t/3+1>=P)
					{
						count++;
						continue;
					}
				}
				else
				{
					if(t/3>=P)
					{
						count++;
						continue;
					}
				}
				if(t%3==2 && sur<S)
				{
					if(t/3+2 >=P)
					{
						sur++;
						count++;
						continue;
					}
				}
				else if(t%3 == 0 && sur<S)
				{
					if(t/3+1>=P)
					{
						sur++;
						count++;
						continue;
					}
				}
			}
			fw.write("Case #" +i +": "+ count +"\n");
		}
		fw.close();
	}
}