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);
		
		
		
	}
}

package codeJam2011;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class B {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			BufferedReader input = new BufferedReader (new InputStreamReader(new FileInputStream("./bin/codeJam2011/B-small-attempt0.in")));
			BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("./bin/B.out")));
			
			int cases = Integer.parseInt(input.readLine());
			for ( int i =0; i < cases ;i++)
			{
				int bestCounter =0;
				String [] line = input.readLine().split(" ");
				int su = Integer.parseInt(line[1]);
				int best = Integer.parseInt(line[2]);
				
				
				for(int n =3; n<line.length; n++)
				{
					
					int score = Integer.parseInt(line[n]);
					if(score >= 3*best-2)
					{
						bestCounter++;
					}
					else if(3*best-4>0 & score >= 3*best-4   & su >0   )
					{
						bestCounter++;
						su --;
					}
					
				}
				output.write("Case #"+(i+1)+": "+bestCounter+"\n");
				System.out.println("Case #"+(i+1)+": "+bestCounter);
				
			}
			output.close();
		} catch (Exception e) {
			e.printStackTrace();
		}

	}

}
