/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.util.*;
public class q2 {

	public static void main(String args[]){
		new q2().run();
	}
	Scanner input = new Scanner(System.in);
	
	
	
	void run(){
		int N = input.nextInt();
		for(int i=1;i<=N;i++){
			System.out.print("Case #"+i+": ");
			solve();
		}
	}
	void solve(){
		int i,j,k;
		int T = input.nextInt();
		int s = input.nextInt();
		int p = input.nextInt();
		int x,m,ans = 0;
		double y;
		Integer [] a = new Integer [T];
		boolean [] used = new boolean[T];
		for(i=0;i<T;i++)
			a[i] = input.nextInt();
		
		for(i=0;i<T;i++){
			x = a[i]/3;
			if(a[i]%3==0){
				if(x >= p)ans++;
				else if(s > 0 && x > 0 && x + 1 >= p){
					ans++;
					s--;
				}
			}
			else if(a[i]%3==1){
				if(x>=p || x+1>=p)
					ans++;
				else if (s > 0 && x + 1 >= p){
					ans++;
					s--;
				}
			}
			else if(a[i]%3==2){
				if(x+1 >= p || x>= p)
					ans++;
				else if(s>0 && x+2 >= p){
					ans++;
					s--;
				}
			}
		}
		System.out.println(ans);
	}
	
	
}
