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.Scanner;


class DancingWithGooglers {

    Scanner s = new Scanner(System.in);
	
    public static void main(String args[]) {
	    DancingWithGooglers p = new DancingWithGooglers();
	    p.run();
	}
	
	void run() {
	    prepare();
	    int nCases = s.nextInt();
		for (int i=0; i<nCases; i++) {
			System.out.println("Case #"+(i+1)+": "+runOneCase());
		}
	}
	
	int[][] mTable = new int[31][2];
	
	void prepare() {
	    for (int i=1; i<=28; i++) {
		    mTable[i][0] = (i+2) / 3;
			mTable[i][1] = (i+4) / 3;
		}
		
		mTable[29][0] = 10;
		mTable[29][1] = 10;
		mTable[30][0] = 10;
		mTable[30][1] = 10;
	}
	
	int runOneCase() {
	    int N = s.nextInt();
		int S = s.nextInt();
		int P = s.nextInt();
		
		int count = 0;
		for (int i=0; i<N; i++) {
		    int score = s.nextInt();
			if (mTable[score][0] >= P) {
			    count++;
		    } else if (S>0 && mTable[score][1]>=P) {
			    count++;
				S--;
			}
		}
	    return count;
	}

}