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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class DancingWiththeGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new DancingWiththeGooglers().fun();
	}
	
	private void fun()
	{
		String file = "D:/CodeJam/inputB.in";
		try {
			scan = new Scanner(new File(file));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		int cases = scan.nextInt();
		
		for(int i = 1; i <= cases ; i++)
		{
			int noOfGooglers = findTheResult();
			System.out.println("Case #"+i+": "+noOfGooglers);
		}
	}
	
	private int findTheResult()
	{
		int googlers = scan.nextInt();
		int surprising = scan.nextInt();
		int minScore = scan.nextInt();
		int minValue = getMinValue(minScore);
		int criticValue1 = minValue;
		int criticValue2 = criticValue1 + 1;
		int count = 0;
		int criticalCount = 0;
		for(int i = 0; i< googlers; i++)
		{
			int score = scan.nextInt();
			if(minValue == 0)
			{
				count++;
				continue;
			}
			else if(minValue == 1)
			{
				if(score >= minValue)
					count++;
				continue;
			}
			if(score >= minValue)
			{
				if(score == criticValue1 || score == criticValue2)
				{
					if(criticalCount < surprising)
					{
						count++;
						criticalCount++;
					}
				}
				else
					count++;
			}
		}
		return count;
	}
	
	private int getMinValue(int minScore)
	{
		int value = 0;
		if(minScore > 2)
		{
			value = minScore - 2;
			value = minScore + value*2;
		}
		else
			value = minScore;
		
		return value;
	}
	
	Scanner scan = null;
}
