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.Scanner;


public class GooglersDancing {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int noCases = in.nextInt();
		
		for(int i = 0; i < noCases; i++){
			int noGooglers = in.nextInt();
			int noSuprises = in.nextInt();
			int minBestResult = in.nextInt();
			ArrayList<Integer> scores = new ArrayList<Integer>();
			ArrayList<Integer> possibleSurprises = new ArrayList<Integer>();
			for(int j = 0; j < noGooglers; j++){
				scores.add(in.nextInt());
				possibleSurprises.add(0);
			}
			int counter = 0;
			for(int j = 0; j < noGooglers; j++){
				int score = scores.get(j);
				int others = score - minBestResult;
				if(others < 0){
					possibleSurprises.set(j,-2);
					continue;
				}
				if(score < 2){
					possibleSurprises.set(j,-1);
					if(score == 0 && minBestResult == 0){
						counter++;
						continue;
					}
					if(score == 1 && (minBestResult <= 1)){
						counter++;
						continue;
					}
					continue;
				}
				if(score > 28){
					possibleSurprises.set(j,-1);
					counter++;
					continue;
				}
				if(Math.ceil(others / 2) < (minBestResult - 2)){
					possibleSurprises.set(j,-2);
					continue;
				}
				counter++;
				if((others >= minBestResult*2-2) && (others <= minBestResult*2+2)){
					possibleSurprises.set(j,1); //maybe surprise
				}
				else {
					boolean foundMaybe = false;
					for(int k = minBestResult+1; k <= 10; k++){
						others = score - k;
						if((others >= k*2-2) && (others <= k*2+2)){
							possibleSurprises.set(j,1); //maybe surprise
							foundMaybe = true;
							break;
						}
					}
					if(!foundMaybe){
						possibleSurprises.set(j,2); // must be surprise
					}
				}
			}
			
			int must = 0;
			int maybe = 0;
			int noes = 0;
			for(Integer surp : possibleSurprises){
				if(surp.intValue() == 1){
					maybe++;
				}
				if(surp.intValue() == 2){
					must++;
				}
				if(surp.intValue() == -1){
					noes++;
				}
			}
			if(must > noSuprises){
				System.out.println("Case #"+(i+1)+": " + (noSuprises+maybe+noes));
			}
			else{
				System.out.println("Case #"+(i+1)+": " + counter);
			}
		}
	}

}
