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


public class DancingWithTheGooglers {
	public static int Solve(String q) {
		StringTokenizer st = new StringTokenizer(q, " ");
		int n = Integer.parseInt(st.nextToken());
		int s = Integer.parseInt(st.nextToken());
		int p = Integer.parseInt(st.nextToken());
		int t;
		int d;
		int r;
		int ans = 0;
		
		while(st.hasMoreTokens()) {
			t = Integer.parseInt(st.nextToken());
			d = t / 3;
			r = t % 3;
			
			if(p - d <= 0) 
				ans++;
			else if(p - d == 1) {
				if(r != 0)
					ans++;
				else if(s > 0 && r == 0 && t != 0) {
					s--;
					ans++;
				}
			}
			else if(p - d == 2 && s > 0 && r == 2) {
				ans++;
				s--;
			}
		}
		
		return ans;
	}
}
