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.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;


public class Q2DancingWithGooglers {

	public static void main(String[] args) throws IOException {
		
		Scanner scanner = new Scanner(new File("q2.input"));
		
		FileWriter writer = new FileWriter("q2.output");
		
		int cases = scanner.nextInt();
		
		for (int i = 1; i <= cases; i++) {
			
			int n = scanner.nextInt();
			int s = scanner.nextInt();
			final int p = scanner.nextInt();
			
			List<Integer> cantBeSurprising = new ArrayList<Integer>(n);
			List<Integer> canBeSurprising = new ArrayList<Integer>(n);
			
			for (int j = 0; j < n; j++) {
				int t = scanner.nextInt();
				if (canBeSurprising(t)) {
					canBeSurprising.add(t);
				} else {
					cantBeSurprising.add(t);
				}
			}
			
			Collections.sort(canBeSurprising, new Comparator<Integer>() {

				@Override
				public int compare(Integer o1, Integer o2) {
					return getPriority(o1).compareTo(getPriority(o2));
				}

				private Integer getPriority(Integer o1) {
					if (getSurprisingP(o1) >= p && getNormalP(o1) < p) {
						return 0;
					}
					
					if (getSurprisingP(o1) >= p) {
						return 1;
					}
					
					return 2;
				}
			});
			
			int response = 0;
			
			for (int j = 0; j < s; j++) {
				if (getSurprisingP(canBeSurprising.get(j)) >= p) {
					response++;
				}
			}
			
			for (int j = s; j < canBeSurprising.size(); j++) {
				if (getNormalP(canBeSurprising.get(j)) >= p) {
					response++;
				}
			}
			
			for (Integer t : cantBeSurprising) {
				if (getNormalP(t) >= p) {
					response++;
				}
			}
			
			writer.write("Case #" + i + ": " + response + "\n");
		}
		
		writer.close();
		
	}
	
	
	
	private static boolean canBeSurprising(int n) {
		if (n == 30 || n == 0 || n == 29) {
			return false;
		}
		return true;
	}
	
	private static Integer getSurprisingP(int n) {
		if (n % 3 <= 1) {
			return n / 3 + 1;
		}
		if (n % 3 == 2) {
			return n / 3 + 2;
		}
		
		return 0;
	}
	
	private static Integer getNormalP(int n) {
		if (n % 3 == 0) {
			return n / 3;
		}
		return n / 3 + 1;
	}
	
}
