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.*;

public class Dancing {

    public static void main (String[] args) throws IOException {
        BufferedReader input = new BufferedReader(new FileReader (args[0]));
        FileWriter output = new FileWriter("dancingOutput.txt");
        int numTests = Integer.parseInt(input.readLine());
        for (int test = 1; test <= numTests; test++) {
            output.write("Case #" + test + ": ");
            String testCase = input.readLine();
            String[] split = testCase.split(" ");
            int[] nums = new int[split.length - 3];
            int numGooglers = Integer.parseInt(split[0]);
            int surprising = Integer.parseInt(split[1]);
            int maxScore = Integer.parseInt(split[2]);
            int firstScore = maxScore + Math.max(maxScore-1, 0)*2;
            int secondScore = maxScore + Math.max(maxScore-2, 0)*2;
            for (int i = 3; i < split.length; i++) {
                nums[i-3] = Integer.parseInt(split[i]);
            }
            int sum = 0;
            for (int i = 0; i < nums.length; i++) {
                if (nums[i] >= firstScore) {
                    sum++;
                } else if (surprising > 0 && nums[i] >= secondScore) {
                    sum++;
                    surprising--;
                }
            }
            output.write(sum + "\n");
        }
        output.flush();
    }

}
