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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;


/**
 * 
 * Google Code Jam 2012 Qualification Round - Problem B. Dancing With the Googlers
 * 
 * @author matlock
 *
 */
public class DancingGooglers {

	public static void main(String[] args) {
		DancingGooglers g = new DancingGooglers();
		g.goGo();
	}
	
	public void goGo() {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		try {
			int testCases = Integer.parseInt(in.readLine());
			
			for (int i = 1; i <= testCases; i++) {
				String inputText = in.readLine();
				String[] valueParse = inputText.split(" ");
				int index = 0;
				int numGooglers = Integer.valueOf(valueParse[index++]);
				int numSurprising = Integer.valueOf(valueParse[index++]);
				int targetVal = Integer.valueOf(valueParse[index++]);
				List<Integer> scores = new ArrayList<Integer>();
				
				for (int k = 0; k < numGooglers; k++) {
					scores.add(Integer.valueOf(valueParse[index++]));
				}
				
				int result = runTestCase(scores, numSurprising, targetVal);
				
				System.out.println("Case #" + i + ": " + result);
			}
		} catch (IOException e) {
			System.out.println("Exception: " + e.getMessage());
		}
	}
	
	private int runTestCase(List<Integer> scoreList, int numSurprising, int targetVal) {
		Collections.sort(scoreList);
		int targetCount = 0;
		
		if (targetVal == 0) { // if target score is 0 then all work
			return scoreList.size();
		}
		
		for (int score : scoreList) {
			if ((score - targetVal) / 2 < (targetVal - 2) || (score <= 0)) {
				continue; // skip impossible score
			}
			// process surprising score
			if (((score - targetVal) / 2 >= (targetVal - 2)) && (numSurprising > 0)) {
				targetCount++;
				numSurprising--;
			// all of these scores should be valid, within 1
			} else if ((score - targetVal) / 2 >= (targetVal - 1)) {
				targetCount++;
			} else {
				// skip
			}
		}
		
		return targetCount;
	}
	
}
