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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.StringTokenizer;

public class B {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		int n; // # googlers
		int s; // surprising
		int p; // score
		int scores[];
		int max;
		int min;
		int ret;

		BufferedReader br = new BufferedReader(new FileReader("b.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("b.out"));
		StringTokenizer tk;

		int tests = Integer.parseInt(br.readLine().trim());

		for (int t = 1; t <= tests; t++) {
			tk = new StringTokenizer(br.readLine());
			n = Integer.parseInt(tk.nextToken());
			s = Integer.parseInt(tk.nextToken());
			p = Integer.parseInt(tk.nextToken());

			max = 3 * p - 2;
			min = 3 * p - 4;

			ret = 0;
			scores = new int[n];
			for (int j = 0; j < scores.length; j++)
				scores[j] = Integer.parseInt(tk.nextToken());

			Arrays.sort(scores);

			if (p >= 2)
				for (int i = scores.length - 1; i >= 0; i--) {
					if (scores[i] >= max)
						ret++;
					else if (scores[i] < min)
						break;
					else {
						
						if (s==0)break;
						ret++;
						s--;
					}
				}

			else {
				if (p == 0)
					ret += scores.length;
				else
					for (int i = scores.length-1; i>=0; i--) {
						if (scores[i] > 0)
							ret++;
						else
							break;
					}

			}

//			System.out.println("Case #" + t + ": " + ret);
			bw.write("Case #" + t + ": " + ret);
			bw.newLine();

		}

		bw.close();
	}

}
