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.FileWriter;
import java.io.IOException;
import java.util.Scanner;

class Test{	
	int output;
	char[] mapping;
	String line;
	int S;
	int P;
	int[] Ti;
	
	public Test(String line){
		Scanner lineReader = new Scanner(line);
		int N = lineReader.nextInt();
		S = lineReader.nextInt();
		P = lineReader.nextInt();
		Ti = new int[N];
		for (int i = 0; i < N; i++){
			Ti[i] = lineReader.nextInt();
		}
	}
	
	public int getOutput(){
		return output;
	}

	public void solve(){
		for (int x: Ti){
			if(P == 0){
				output++;
			}
			else if((x >= P*3 -2  && x > 0)){
				output++;
			}
			else if(x >= P*3 -4 && S > 0  && x > 0 && P > 1){
				output++;
				S--;
			}
		}
	}
	
	public char translate(char c){
		if (c == ' '){
			return c;
		}
		boolean changeCase = false;
		if(c != Character.toLowerCase(c)){
			c = Character.toLowerCase(c);
			changeCase = true;
		}
		char toReturn = mapping[Character.valueOf(c) - Character.valueOf('a')];
		if(changeCase){
			toReturn = Character.toUpperCase(toReturn);
		}
		return toReturn;
	}
	
}

public class ProblemB {
	
	public static void main(String[] args) throws IOException{
		File inputFile = new File("input.txt");
		Scanner scan = new Scanner(inputFile);
		int loopCount = scan.nextInt();
		scan.nextLine();
		FileWriter outputFile = new FileWriter("output.txt");
		for(int i = 1; i <= loopCount; i++){
			Test start = new Test(scan.nextLine());
			start.solve();
			outputFile.write("Case #"+i+": " + start.getOutput());
			if(i < loopCount){
				outputFile.write("\r\n");
			}
		}
		outputFile.close();
	}
}
