import java.util.Scanner;
public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int zz = 1; zz <= T;zz++){
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int x = 0;
			for(int i = 0; i < N;i++){
				int score = in.nextInt();
				int best = score/3;
				int mod = score%3;
				int diff = p-best;
				if(diff<1){
					x++;
				}else if(diff<2){
					if(mod==0 && score !=0){
						if(S!=0){
							S--;x++;
						}
					}else if(score!=0){
						x++;
					}
				}else if(diff<3){
					if(mod==2){
						if(S!=0){
							S--;x++;
						}
					}
				}
			}
			System.out.format("Case #%d: %d\n", zz, x);
		}
	}
}



import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;

//Using the Google Collections library.
public class B {

	public static void main(String [] args) throws IOException {
		String inputFile = "src/B-large.in";
		Scanner in = new Scanner(new File(inputFile));
		PrintStream out = new PrintStream(inputFile.substring(0, inputFile.length()-2)+"out");
		int cases = in.nextInt();
		for (int c = 1; c <= cases; c++) {
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int noSurpriseThresh = p*3-2;
			int surpriseThresh = p*3 - 4;
			int count = 0;
			int surpriseCount = 0;
			for (int i = 0; i < n; i++) {
				int cur = in.nextInt();
				if (cur == 0 && p > 0) {
					continue;
				} else if (cur >= noSurpriseThresh) {
					count++;
				} else if (cur >= surpriseThresh) {
					surpriseCount++;
				}
			}
			count += Math.min(s, surpriseCount);
			out.print("Case #"+c+": "+count);
			out.println();
		}
		out.close();
	}
}
