/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;


public class DancingWithTheGooglers {

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader(args[0]));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(args[0]+".out")));
		String l = in.readLine();
		int N = Integer.parseInt(l);
		int i=1;
		while((l=in.readLine())!= null)
		{
			int cnt = 0;
			out.print("Case #"+i+++": ");
			String ll[] = l.split(" ");
			int S = Integer.parseInt(ll[1]);
			int p = Integer.parseInt(ll[2]);
			//da ll[3]; a ll[ll.length-1]; somme
			ArrayList<Integer> amb = new ArrayList<Integer>();
			int cntA=0;
			for(int z=3;z<ll.length;z++)
			{
				int sum = Integer.parseInt(ll[z]);
				if(p==0)
				{
					cnt++;
					continue;
				}
				if(p==1)
				{
					if(sum>0) cnt++;
					continue;
				}
				int foo = p+(p-1)+(p-1);
				int bar = p+(p-2)+(p-2);
				if(sum>=foo) cnt++;
				else if(sum>=bar) cntA++;
			}
			cnt+= Math.min(cntA,S);
			out.print(cnt);
			if(i<=N) out.println("");
		}
		in.close();
		out.close();
	}
}
