package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

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