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.io.*;
import java.util.Scanner;
 
public class functions {
	int mod(int a){
	 int b = 0;
	 if(a > 0) b = a; else b = -a;
	 
	 return b;
	}
	int solve(int[] a, int p, int s, int n){
		int result = 0;
		int i = 0;
		int x = 0;
		int onlyS = 0;
		int onlyNotS = 0;
		int both = 0;
		int none = 0;
		for ( i = 0;i < n; i++){
			x = a[i]/3;
			if(a[i]%3 ==0){

				if(a[i] == 30){
					onlyNotS++;

				}
				else if(p==x+1 && a[i]!=0){
					onlyS++;

				}
				else if ( p<=x ){
					both++;

				}
				else{

					none++;
				}
			}
			else if(a[i]%3 ==1){

				if(a[i]==1 && p<=1){
					onlyNotS++;
				}
				else if(p <= x+1){
					both++;
				}
				else none++;
			}
			else{

				if(a[i] == 29){

					onlyNotS++;
				}
				else if(p == x+2){

					onlyS++;
				}		
				else if(p <= x+1){

					both++;
				}
				else {
				none++;

				}				
			}
			
		}
		
		
		if(onlyS <= s){
			result = both+onlyNotS+onlyS;
		}
		else{
			result = s+both+onlyNotS;
		}
		
		return result;
	}
}
