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

public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();

		int counter = 1;
		while (T-- > 0) {
			int returned = 0;
			int N = scan.nextInt();
			int surp = scan.nextInt();
			int theMax = scan.nextInt();
			double[] array = new double[N];
			for (int i = 0; i < array.length; i++) {
				array[i] = scan.nextDouble();
			}
			for (int i = 0; i < array.length; i++) {
				if (Math.ceil((double) array[i] / 3) >= theMax) {
					returned++;
				} else if (array[i] >= theMax) {
					double temp = array[i] - theMax;
					double first = theMax;
					double second = Math.ceil((double) temp / 2);
					double third = temp - second;

					double diff1 = Math.abs(first - second);
					double diff2 = Math.abs(second - third);
					double diff3 = Math.abs(first - third);

					if (diff1 <= 2 && diff2 <= 2 && diff3 <= 2) {
						if (diff1 == 2 || diff2 == 2 || diff3 == 2) {
							if (surp > 0
									&& (first >= theMax || second >= theMax || third >= theMax)) {
								surp--;
								returned++;
							}
						}
					}
				}
			}
			System.out.println("Case #" + counter++ + ": " + returned);
		}
	}
}