package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.LinkedList;


public class Dancers {

	static LinkedList<Integer> scores;
	static int googlers = 0;
	static int surprising = 0;
	static int p;
	
	
	public static void main(String[] args) {
		String text = "";
		int tests = 0;
		int test_index=0;
		int result;
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			tests = Integer.parseInt(br.readLine());		
			while ((text = br.readLine()) != null && test_index < tests){							
				test_index++;
				String[] testcase = text.split(" ");
				googlers = Integer.parseInt(testcase[0]);
				surprising = Integer.parseInt(testcase[1]);
				p = Integer.parseInt(testcase[2]);
				int i = 3;
				scores = new LinkedList<Integer>();
				while(i<testcase.length){
					scores.add(Integer.parseInt(testcase[i]));
					i++;
				}
				result = calc();
				System.out.println("Case #" + test_index + ": " + result);
			}
		} catch (Exception e) {e.printStackTrace();}				
	}

	private static int calc() {
		int result = 0;
		for(int x : scores){
			
			if(p == 0) { result = scores.size(); break; }
			
			if(x == 0 && p == 0) { result++; continue; }
			if(x == 0 && p != 0) { continue; }
				
			int surpriseLimit = Math.max(p+(p-2)+(p-2),0);
			int okLimit = Math.max(p+(p-1)+(p-1),0);
			if(x >= okLimit) { result++; }			
			if(x >= surpriseLimit && x < okLimit && surprising > 0){
				surprising--;
				result++;
			}			
			
		}
		return result;
	}
	
}
