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 DancingWithTheGooglers {

    private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));    
    private static Scanner sc = new Scanner(br);

    public static void main ( String [] args ) throws IOException
    {
	int N = Integer.parseInt(br.readLine());

	for(int i = 0;i < N; i++) {
	    System.out.print("Case #" + (i+1) + ": ");
	    new DancingWithTheGooglers().cal();
	}
    }



    private void cal() throws IOException 
    {
    	int ret = 0;
    	
    	int number = sc.nextInt();
    	int[] numberArray = new int[number];
    	
    	int surprising = sc.nextInt();
    	int p = sc.nextInt();
    	
    	
    	int sDeadLine = p*3-4;
    	int deadLine = p*3-2;
    	if (p == 0){
    		sDeadLine = 100;
    		deadLine = 0;
    	}
    	if (p == 1){
    		sDeadLine = 100;
    		deadLine = 1;
    	}
    	
    	boolean[] okay = new boolean[number];
    	boolean[] sOkay = new boolean[number];

    	int okayCounter = 0, sOkayCounter = 0;
    	
    	
    	for(int i = 0; i < number; i++){
    		numberArray[i] = sc.nextInt();
    		if (numberArray[i] >= deadLine){
    			okay[i] = true; okayCounter++;
    			sOkay[i] = true; sOkayCounter++;
    		} else if( numberArray[i] >= sDeadLine ){
    			okay[i] = false;
    			sOkay[i] = true; sOkayCounter++;
    		} else {
    			okay[i] = false;	
    			sOkay[i] = false;
    		}
    	}
    	
    	ret = okayCounter;
    	ret += (sOkayCounter - okayCounter) > surprising? surprising : (sOkayCounter - okayCounter);   
    		
    	System.out.println(ret);
    	

    }

}


