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.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;


public class GCJ_2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
		
		int T = scan.nextInt();
		scan.nextLine();
		
		int nCase = 1;
		while (T-- > 0) {
			
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			
			PriorityQueue<Integer> queue = new PriorityQueue<Integer>(10, new Comparator<Integer>() {

				@Override
				public int compare(Integer o1, Integer o2) {
					
					return o2.compareTo(o1);
				}
				
			});
			for (int i = 0; i < N; i++) {
				queue.add(scan.nextInt());
			}
			
			int output = 0;
			while (!queue.isEmpty() && S >= 0) {
				Integer i = queue.poll();
				//System.out.println(i);
				int r = i % 3;
				int q = i / 3;
				
				if (r != 0) q++;
				
				//dont need to be surprising
				if (q >= p) {
					output++;
					continue;
				}
				
				if (S == 0) break; //dont need continue processing
				if (q == 0) continue;
				//needs to use surprising
				S--;
				if (r == 0) //everybody is equal
				{
					q++;
				} else if (r == 1)  
				{
					//cant add
				} else {
					q++;
				}
				
				if (q >= p) output++;
				
			}
			
			
			scan.nextLine();
			
			System.out.println("Case #" + (nCase++) + ": " + output);
		}

	}

}
