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();
	}
}

package test;
import java.io.*;

public class Test {
	
	static public void magic(String tmp, int Result [],int index ){
		int N=0,S=0,P=0,size;
		char Carr []= new char[300];
		size=tmp.length();
		tmp.getChars(0, size, Carr, 0);
		
		int i=0,j=0,spc=0;
		String bom;
		while (spc<3){
			
			if(Carr[j]!=' '){
				j++;
			}else{
				bom=tmp.substring(i, j);
				if(spc==0)
					N=Integer.parseInt(bom);
				if(spc==1)
					S=Integer.parseInt(bom);
				if(spc==2)
					P=Integer.parseInt(bom);
				spc++;
				j++;
				i=j;
			}
		}
		
		int counter=N;
		int bomnum,nosur,sur,ans=0;
		nosur=((P-1)*2)+P;
		sur=((P-2)*2)+P;
		if(sur<0)
			sur=1;
		while (counter>0){
			if(Carr[j]!=' '&&j<size){
				j++;
			}else{
				bom=tmp.substring(i, j);
				bomnum=Integer.parseInt(bom);
				if(bomnum>=nosur){
					ans++;
				}else if(bomnum>=sur && S>0){
					ans++;
					S--;
				}
				j++;
				i=j;
				counter--;
			}
		}
		
		Result[index]=ans;
		
	}
	
	public static void main(String[] args) {
		
		////////
		int index=0,T,casenum=1,j;
		String tmp;
		
		int Result[]=new int [101];
		
		////////
		
		BufferedReader reader;
		reader = new BufferedReader(new InputStreamReader(System.in));
		try {
			tmp = reader.readLine();
			T=Integer.parseInt(tmp);
			
			j=T;
			while(j!=0){
				tmp = reader.readLine();
				magic (tmp,Result,index);
				
				index++;
				j--;
			}
			
			j=T;
			while(j!=0){
				System.out.println("Case #"+casenum+": "+Result[casenum-1]);
				casenum++;
				j--;
			}
			
			
		} catch (IOException e) {
			e.printStackTrace();
		}	
	}
}
