import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.io.IOException;
import java.util.List;

public class Dancing extends JamProblem {

    public static void main(String[] args) throws IOException {
        Dancing p = new Dancing();
        p.go();
    }

    @Override
    String solveCase(JamCase jamCase) {
        int res = 0;
        DancingCase ca = (DancingCase) jamCase;
        for (int i = 0; i < ca.sums.length; i++) {
            int sum = ca.sums[i];
            if (sum == 0) {
                if (ca.p == 0) {
                    res++;
                }
                continue;
            }
            int n = sum % 3;
            int one = sum / 3;
            if (n == 0) {
                if (one >= ca.p) {
                    res++;
                    continue;
                }
                if (ca.sup > 0) {
                    if (one + 1 >= ca.p) {
                        res++;
                        ca.sup--;
                    }
                }
            }

            if (n == 1) {

                if (one + 1 >= ca.p) {
                    res++;
                }
            }
            if (n == 2) {
                if (one + 1 >= ca.p) {
                    res++;
                    continue;
                }

                if (ca.sup > 0) {
                    if (one + 2 >= ca.p) {
                        res++;
                        ca.sup--;
                    }
                }
            }
        }
        return "" + res;
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        DancingCase ca = new DancingCase();
        ca.lineCount = 1;
        String s = file.get(line);
        List<Integer> integers = JamUtil.parseIntList(s);
        int gs = integers.get(0);
        ca.sup = integers.get(1);
        ca.p = integers.get(2);
        ca.sums = new int[gs];
        for (int i = 0; i < gs; i++) {
            ca.sums[i] = integers.get(3 + i);
        }

        return ca;
    }
}

class DancingCase extends JamCase {
    int p;
    int[] sums;
    int sup;
}