import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;
public class DancingWiththeGooglers {

public static void main(String[] args) throws Exception {
    PrintWriter out = new PrintWriter("output.out");
    Scanner in = new Scanner(new File("B-small-attempt4.in"));
    int testCases = in.nextInt();
     for (int i = 1; i <= testCases; i++){
        int N = in.nextInt(),counter=0;
         int S = in.nextInt();
         int P = in.nextInt();
         for(int j = 0 ; j < N ;j++){ 
             int googler= in.nextInt();
                 if(googler%3 == 0 && googler!=0){
                     if(googler/3 >= P){
                         counter++;
                                      }
                  else if(googler/3 + 1 >= P && S!=0){
                              counter++;
                               S--;
                                       }
                             }
           else if (googler==0 && P==0){
            counter++;
                          }
           else if(googler%3==1){
         if(googler/3 + 1 >= P){
          counter++;
}
}
else if(googler%3==2){
if(googler/3 + 1 >= P){
counter++;
}
else if(googler/3 + 2 >= P && S!=0){
counter++;
S--;
}
}
}
out.printf("Case #%d: %d",i,counter);
out.printf("\n");
}
out.close();
in.close();

}

}