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.Scanner;
import java.util.Arrays;
import java.io.*;
public final class problem1 {
	static int N;
	static int S;
	static int p;


	public static String getResult(int[] input){
		Arrays.sort(input);
		
		int min;
		if(p < 2)
			min = p;
		else
			min = p + (p-2) + (p-2);
			
		int sur = S;
		int total = 0;
		for(int i = 0 ; i < input.length ; i++){
			//System.out.print(input[i] + " " + min);
			//large than min surprise -> will handle this value
			if(input[i] >= min && input[i] <= 28){
				if(input[i] % 3 == 2){ //value like 11
					if(sur > 0){
						int large = input[i] / 3 + 2;
						if(large >= p){
							total++;
							sur--;
						}
					}else{
						int large = input[i] / 3 + 1;
						if(large >= p){
							total++;
						}
					
					}
					
				}else if(input[i] % 3 == 1){//value like 13
					if(sur > 0){
						int large = input[i] / 3 + 1;
						if(large >= p){
							total++;
							sur--;
						}
					}else{
						int large = input[i] / 3 + 1;
						if(large >= p){
							total++;
						}
					
					}
				
				
				}else{ // valeu like 15
					
					if(sur > 0){
						int large = input[i] / 3 + 1;
						if(large >= p){
							total++;
							sur--;
						}
					}else{
						int large = input[i] / 3;
						if(large >= p){
							total++;
						}
					}
				
				}
			
			}else if(input[i] > 28){
				total++;
			}
		
		}
		//System.out.println();
		return Integer.toString(total);
	}
	
	

	public static void main(String[] args){
		try{
			//Scanner sc = new Scanner(new File("yo.txt"));
			Scanner sc = new Scanner(new File("B-small-attempt0.in"));
			FileWriter fw = new FileWriter("small.txt");
		
			String tmp = sc.nextLine();
			int step = Integer.valueOf(tmp);
		
			int counter = 1;
			while(sc.hasNextLine()){

				String s = sc.nextLine();
				Scanner ssc = new Scanner(s);
				N = ssc.nextInt();
				S = ssc.nextInt();
				p = ssc.nextInt();
				
				int[] arr = new int[N];
				for(int i = 0 ; i < N ; i++)
					arr[i] = ssc.nextInt();

				String xx = getResult(arr);
				System.out.println("Case #" + counter + ": " + xx);
				
				
				fw.write("Case #" + counter + ": " + xx);
				fw.write("\n");
				counter++;
				if(step < counter)
					break;
			}
			fw.close();
		}catch(Exception e){}
		
	}
	
}