import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}


import java.util.Scanner;

public class BDancingWithGooglers {
    public static void main(String[] ags)   {
      //System.setIn(new FileInputStream("src/com/afarok/google/codejam2012/qualificationround/B-small-attempt1.in"));
      //System.setOut(new PrintStream(new File("src/com/afarok/google/codejam2012/qualificationround/B-small-attempt1.out")));
        Scanner stdIn = new Scanner(System.in);
        int t = stdIn.nextInt();
        for(int tCase=1;tCase<=t;++tCase) {
            int n = stdIn.nextInt();
            int ns = stdIn.nextInt();
            int p = stdIn.nextInt();
            
            int y =0;
            for(int i=0;i<n;++i) {
                int nextTotal = stdIn.nextInt();
                int d = nextTotal/3;
                int r = nextTotal%3;
                
                if(nextTotal<p) continue;
                
                if(d>=p) {
                    ++ y;
                    continue;
                }
                
                if(p-d>2) continue;
                
                if(p-d==1) {
                    if(r>0) {
                        ++y;
                        continue;
                    } else {
                        if(ns>0) {
                            ++y;
                            --ns;
                            continue;
                        }
                    }
                } else {
                    if(ns>0 && r==2) {
                        ++y;
                        --ns;
                        continue;
                    }
                }
                
                
            }
            System.out.println("Case #"+tCase+": "+y);
        }
    }
}
