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

public class Test {
	public static void main(String[] args) {
		int cases, num, sur, p;
		int[] googlers;
		Scanner sin = new Scanner(System.in);
		int[] ans;

		cases = sin.nextInt();
		ans = new int[cases];
		for (int i = 0; i < cases; i++) {
			int count = 0;
			int couSur = 0;
			int center, notSurLeast, least;

			num = sin.nextInt();
			googlers = new int[num];
			sur = sin.nextInt();
			p = sin.nextInt();
			for (int j = 0; j < num; j++)
				googlers[j] = sin.nextInt();

			center = 3 * p;
			notSurLeast = center - 2;
			least = center - 4;
			if (least < p)
				least = p;
			for (int j = 0; j < num; j++)
				if (googlers[j] >= least) {
					count++;
					if (googlers[j] < notSurLeast)
						couSur++;
				}
			
			if (couSur > sur)
				count -= (couSur - sur);
			ans[i] = count;
		}

		for (int i = 0; i < cases; i++)
			System.out.println("Case #" + (i + 1) + ": " + ans[i]);
	}
}