import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.util.ArrayList;


public class App {

	/**
	 * @param args
	 */
	public static void main(String[] args) 
	{
		Reader reader = new Reader();
		ArrayList<String> input = reader.LinesReader();
		
		ArrayList<String> output = new ArrayList();
		for (String i : input)
		{
			output.add(handleCase(i));
		}
		reader.output(output);
	}

	private static String handleCase(String s) 
	{
		String output = "";
		
		String[] split = s.split(" ");
		ArrayList<Integer> listInt = new ArrayList<Integer>();
		
		for (String string : split)
		{
			listInt.add(Integer.valueOf(string));
		}
		
		int nbGooglers = listInt.get(0);
		int nbSurprising = listInt.get(1);
		int bestResultNeeded = listInt.get(2);
		
		int nbAchieved = 0;
		for (int i = 0; i < nbGooglers; i++)
		{
			double score = listInt.get(3 + i);
			
			if (Math.ceil(score / 3) >= bestResultNeeded)
			{
				nbAchieved++;
			}
			else
			if (nbSurprising > 0)
			{
				// prevention cas negatif
				double maxAdded = 4;
				if (score < maxAdded)
					maxAdded = score;
				if (((score + maxAdded) / 3) >= bestResultNeeded)
				{
					
					nbAchieved++;
					nbSurprising--;
				}
			}
		}
		
		return "" + nbAchieved;
	}

}
