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.*;
import java.util.*;
public class dancing {
	private void go() throws Exception{
		File infile = new File("B-small-attempt0.in");
		BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(infile)));
		int num_of_cases = Integer.parseInt(br.readLine());
		for(int i=1;i<=num_of_cases;i++){
			String cur_str = br.readLine();
			StringTokenizer stk = new StringTokenizer(cur_str);
			int num_of_emp = Integer.parseInt(stk.nextToken());
			int num_of_surprise = Integer.parseInt(stk.nextToken());
			int req_num = Integer.parseInt(stk.nextToken());
			int surprise_not_needed = req_num*3 - 2;
			int surprise_needed = Math.max(req_num*3 -2 -2,1);
			int satisifed = 0;
			int scores[] = new int[num_of_emp];
			for(int k=0;k<num_of_emp;k++)
				scores[k] = Integer.parseInt(stk.nextToken());
			for(int k=0;k<num_of_emp;k++){
				if(scores[k] >= surprise_not_needed){
					satisifed++;
					continue;
				}
				else{
					if(scores[k] >= surprise_needed && num_of_surprise>0){
						satisifed++;
						num_of_surprise--;
						continue;
					}
					else continue;
				}
			}
			System.out.println("Case #"+i+": "+satisifed);
		}
	}
	public static void main(String[] args){
		try {
			new dancing().go();
		} catch (Exception ex) {
			ex.printStackTrace();
		}
	}
}
