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);
		}
	}
}

package gcj2012qr;

import java.io.*;
import java.util.*;
import java.util.concurrent.*;

import com.google.*;

/**
 * @author Roman Kosenko <madkite@gmail.com>
 */
public class DancingWithTheGooglers extends SingleThreadSolution<Object> {
	public static void main(String[] args) throws Exception {
		solve(new SolutionFactory<Object>() {
			public Callable<Object> read(BufferedReader br) throws IOException {
				String[] ss = br.readLine().split(" ");
				int n = Integer.parseInt(ss[0]);
				assert ss.length == n + 3;
				int s = Integer.parseInt(ss[1]);
				int p = Integer.parseInt(ss[2]);
				int[] t = new int[n];
				for(int i = 0; i < n; i++)
					t[i] = Integer.parseInt(ss[3 + i]);
				return new DancingWithTheGooglers(t, s, p);
			}
		}, "google/src/gcj2012qr/" + "B-large.in");
	}
	private final int t[], s, p;
	public DancingWithTheGooglers(int[] t, int s, int p) {
		this.t = t;
		this.s = s;
		this.p = p;
	}
	public String call() throws Exception {
		int result = 0, surprises = s;
		//noinspection ForLoopReplaceableByForEach
		for(int i = 0; i < t.length; i++) {
			int max = (t[i] + 2) / 3;
			if(max + 1 == p && surprises > 0 && (t[i] % 3 == 2 || t[i] % 3 == 0 && t[i] > 0)) {
				surprises--;
				result++;
			} else if(max >= p)
				result++;
		}
		return Integer.toString(result);
	}
}
