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.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class DancingWithTheGooglers {
	public static void main(String[] args){
		Scanner keyin=new Scanner(System.in);
		int T=keyin.nextInt();
		int caseCount=0;
		while ((T--)>0){
			int N=keyin.nextInt();
			int S=keyin.nextInt();
			int P=keyin.nextInt();
			int[] googler=new int[N];
			for (int i=0; i<N; i++){
				googler[i]=keyin.nextInt();
			}
			caseCount++;
			ArrayList<int[][]> googlerScore=new ArrayList<int[][]>();
			
			for (int index=0; index<googler.length; index++){
				int remainder=googler[index];
				int[] arrayInit=new int[3];
				for (int i=3; i>0; i--){
					int temp=remainder/i;
					remainder-=temp;
					arrayInit[3-i]=temp;
				}
				int[][] arrayScore=new int[2][3];
				arrayScore[0]=arrayInit;
				if (arrayInit[0]==arrayInit[1] && arrayInit[1]==arrayInit[2]){
					int[] temp={arrayInit[0]-1,arrayInit[1],arrayInit[2]+1};
					arrayScore[1]=temp;
				}
				else if (arrayInit[0]==arrayInit[1] && arrayInit[1]!=arrayInit[2]){
					int[] temp={arrayInit[0]-1,arrayInit[1]+1,arrayInit[2]};
					arrayScore[1]=temp;
				}
				else if (arrayInit[0]!=arrayInit[1] && arrayInit[1]==arrayInit[2]){
					int[] temp={arrayInit[0],arrayInit[1]-1,arrayInit[2]+1};
					arrayScore[1]=temp;
				}
				//System.out.println(Arrays.deepToString(arrayScore));
				googlerScore.add(arrayScore);
			}
			
			int result=N;
			for (int index=0; index<googlerScore.size(); index++){
				if (googlerScore.get(index)[0][2]<P){
					if (googlerScore.get(index)[1][2]<P){
						result--;
					}
					else {
						if (S>0 && googlerScore.get(index)[1][0]<0){
							S--;
							result--;
							//System.out.println("S R "+S+" "+result);
						}
						else if (S>0){
							S--;
							//System.out.println("S "+S);
						}
						else if (S<=0) {
							result--;
							//System.out.println("R "+result);
						}
					}
				}
			}
			System.out.println("Case #"+caseCount+": "+result);
		}
	}
}
