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.*;
import static java.lang.System.*;

class B{

    static public void main(String[] args){
	Scanner sc = new Scanner(System.in);
	int cases = Integer.parseInt(sc.nextLine());
	for(int c = 1; c<=cases; c++){
	    String[] s = sc.nextLine().split(" ");
	    int n = Integer.parseInt(s[0]);
	    int sur = Integer.parseInt(s[1]);
	    int p = Integer.parseInt(s[2]);
	    int[] score = new int[n];
	    int cz = 0;
	    for(int i = 0; i<n; i++){
		score[i] = Integer.parseInt(s[3+i]);
		if(score[i] == 0)
		    cz ++;
	    }
	    if(p == 1){
		out.println("Case #"+c+": "+(n-cz));
		continue;
	    }
	    if(p == 0){
		out.println("Case #"+c+": "+(n));
		continue;
	    }
	    int cnt = 0;
	    int pot = 0;
	    for(int i:score){
		if(i <= 1) continue;
		int nsur = (i-1)/3+1;
		if(nsur >=p)
		    cnt++;
		else{
		    if(nsur == (p-1)){
			if(i%3 != 1)
			    pot++;
		    }
		}
	    }
	    cnt += Math.min(pot, sur);	
	    out.println("Case #"+c+": "+cnt);
	}
    }

}