/*
 * 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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;

public class GCJB {
	public static void main(String[] args) {
		try {
			FileReader in = new FileReader("./B-small-attempt1.in");
			BufferedReader br = new BufferedReader(in);

			File file = new File("./smallB.txt");
			FileWriter fw = new FileWriter(file);

			String line;
			int num = Integer.valueOf(br.readLine());
			int caseNum = 1;

			while ((line = br.readLine()) != null) {

				StringBuilder sb = new StringBuilder();
				sb.append("Case #" + caseNum + ": ");
				caseNum++;

				String[] lineArray = line.split(" ");
				int n = Integer.valueOf(lineArray[0]);
				int s = Integer.valueOf(lineArray[1]);
				int p = Integer.valueOf(lineArray[2]);
				int res = 0;

				for(int i = 3; i < lineArray.length ; i++){
					if(Integer.valueOf(lineArray[i]) == 0){
						if(p == 0) res++;
						continue;
					}

					int m = Integer.valueOf(lineArray[i])%3;
					int d = Integer.valueOf(lineArray[i])/3;

					if(d >= p) res++;
					else if(m == 0){
						if(d >= (p-1) && s != 0){
							res++;
							s--;
						}
					} else if(m == 1){
						if(d >= (p-1))res++;
					} else if(m == 2){
						if(d >= (p-1))res++;
						else if(d >= (p-2) && s != 0){
							res++;
							s--;
						}
					}
				}

				sb.append(res);
				fw.write(new String(sb));
				fw.write("\n");

			}

			br.close();
			in.close();
			fw.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
}
