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);
		
		
		
	}
}


public class Scores {
	private int N;	// Number of Googlers
	private int S; 	// Number of surprising triplets of scores
	private int p;	// Score at least 
	private int[] t; 	// total point of Googlers

	public Scores(String str) {
		String[] tmpArr = str.split(" "); 
		N = Integer.parseInt(tmpArr[0]); 
		S = Integer.parseInt(tmpArr[1]);
		p = Integer.parseInt(tmpArr[2]);
		
		t = new int[N];
		for (int i=0; i<N; i++) {
			t[i] = Integer.parseInt(tmpArr[i+3]);
		}
	}
	
	public int getMaxNumberOfGooglerOverScore() {
		int minTNormal = 3 * p -2 ;  // Normal : p, p-1, p-1
		int minTSurprising = 3 * p - 4 ; // surprising triplets : p, p-2, p-2
		
		if (p == 0) {
			return t.length; 
		} else if (p == 1) {
			minTSurprising = 3 * p -2 ; // p, p-1, p-1 
		}
		
		
		int maxNumber = 0 ; 		
		int surpNumber = 0 ; 
		for (int i=0; i<N; i++) {
			if (t[i] >= minTNormal) {
				maxNumber++ ; 
			} else if (t[i] >= minTSurprising) {
				surpNumber++ ; 
			}
	 	}
		
		if (S < surpNumber) {
			surpNumber = S ;
		}
		
		return maxNumber+surpNumber; 
	}

}
