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 GCJ_Q_B
{
//	public static String 
//	public static int 
//	ArrayList list = new ArrayList();
//	HashMap map = new HashMap();
//	HashSet set = new HashSet();
	
//	for(int i=0;i<;i++)
	
//	for(int j=0;j<;j++)
	
//	for(int k=0;k<;k++)
	
//	System.out.println();
//	System.out.print();
//	System.out.printf("", new Object{});
//	System.out.printf("", new Integer{});
//	System.out.printf("", new Long{});
	
	public static void main(String[] args) throws Exception
	{
	//	Scanner scanner = new Scanner(new FileInputStream("B.txt"));
		Scanner scanner = new Scanner(new FileInputStream("B-small-attempt0.in"));
		//	Scanner scanner = new Scanner(new FileInputStream("B-large.in"));
		
		BufferedWriter writer = new BufferedWriter(new FileWriter("B.out"));
		
		int N = scanner.nextInt();
		//	scanner.nextLine();
		for(int q=1;q<=N;q++)
		{
			int n = scanner.nextInt();
			int s = scanner.nextInt();
			int p = scanner.nextInt();
			int[] t = new int[n];
			for(int i=0;i<n;i++)
				t[i] = scanner.nextInt();
			String ans = answer(s, p, t);
			System.out.println("Case #"+q+": "+ans);
			writer.write("Case #"+q+": "+ans);
			writer.newLine();
		}
		
		writer.close();
		scanner.close();
	}
	
	public static String answer(int s, int p, int[] t) throws Exception
	{
		int c = 0;
		if(p==1)
		{
			for(int i=0;i<t.length;i++)
				if(t[i] >= 1)
					c++;
		}
		else
		{
			int min = p*3-4;
			int ok = p*3-2;
			for(int i=0;i<t.length;i++)
				if(t[i] >= min)
				{
					if(t[i] >= ok)
						c++;
					else if(s>0)
					{
						s--;
						c++;
					}
				}
		}
		
		return c+"";
	}
	
	
	
	// ç´ å æ°åè§£
	static boolean[] primeList = null;
	
	public static int[] dividePrime(int num)
	{
		if(primeList==null)
			primeList = primeListOfEratosthenes(10000);
		
		if(primeList[num] || num==1)
			return new int[]{num};
		
		ArrayList list1 = new ArrayList();
		for(int i=2;true;i++)
		{
			if(num==1)
				break;
			
			if(num%i==0)
			{
				list1.add(new Integer(i));
				num /= i;
				i--;
			}
		}
		
		int[] ret = new int[list1.size()];
		for(int i=0;i<ret.length;i++)
			ret[i] = ((Integer)list1.get(i)).intValue();
		
		return ret;
	}
	
	// æ´æ°åè§£   1 2 12 3 ...
	public static int[] splitInteger(String s)
	{
		StringTokenizer st = new StringTokenizer(s, " ");
		int[] ret = new int[st.countTokens()];
		for(int i=0;i<ret.length;i++)
			ret[i] = Integer.parseInt(st.nextToken());
		
		return ret;
	}
	
	// ç´ æ°ãªã¹ã
	public static boolean[] primeListOfEratosthenes(int max)
	{
		boolean[] list = new boolean[max+1];
		
		for(int i=2;i<list.length;i++)
		{
			if(!list[i])
			{
				for(int j=i*2;j<=max;j+=i)
					list[j] = true;
			}
		}
		
		for(int i=0;i<list.length;i++)
			list[i] = !list[i];	
		
		list[0] = list[1] = false;
		
		return list;
	}
}
