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

public class B extends CodeJammer {

	public void process() throws IOException {
		int[] input = reader.readArray();
		int n = input[0];
		int s = input[1];
		int p = input[2];
		int auto =0; //scores that reach p automatically
		int poss = 0; //scores that can reach p with surprise
		for (int i=3; i<n+3; i++) {
			int score = input[i];
			int def = (score/3);
			int mod = (score%3);
			if (mod != 0) def++;//ceiling, not floor
			if (def >= p) auto++;
			else if (def == p-1 && def > 0 && mod != 1) poss++;
		}
		if (poss > s) poss = s; //cap number of surprising scores that reach p
		output(auto+poss);
	}

	public static void main(String[] args) {
		B b = new B();
		b.run(args);
	}

}
