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

public class Solver {
	int S;
	int p;
	ArrayList<Integer> scores;

	Solver(int S, int p, ArrayList<Integer> scores) {
		this.S = S;
		this.p = p;
		this.scores = scores;
	}

	static int getMaxScoreNoSuprise(int n) {
		int base = n / 3 - 1;
		if (base < 0)
			base = 0;

		int max = 0;
		for (int i = base; i <= base + 3; i++)
			for (int j = base; j < base + 3; j++)
				for (int k = base; k < base + 3; k++) {
					if (Math.abs(i - j) <= 1 && Math.abs(i - k) <= 1
							&& Math.abs(j - k) <= 1 && (i + j + k) == n) {
						max = Math.max(max, Math.max(i, Math.max(j, k)));
					}

				}
		return max;

	}

	static int getMaxScoreWithSuprise(int n) {
		int base = n / 3 - 1;
		if (base < 0)
			base = 0;

		int max = 0;
		for (int i = base; i <= base + 4; i++)
			for (int j = base; j < base + 3; j++)
				for (int k = base; k < base + 3; k++) {
					if (Math.abs(i - j) <= 2 && Math.abs(i - k) <= 2
							&& Math.abs(j - k) <= 2 && (i + j + k) == n) {
						max = Math.max(max, Math.max(i, Math.max(j, k)));
					}

				}
		return max;
	}

	int solve() {
		
		Collections.sort(scores);
		
//		for(int score : scores)
	//		System.out.println(getMaxScoreNoSuprise(score) + " " + getMaxScoreWithSuprise(score));
		
		int surprises =0 ;
		for(int i=0;i<scores.size();i++)
		{
			if (surprises < S  && getMaxScoreWithSuprise(scores.get(i)) >= p && getMaxScoreNoSuprise(scores.get(i))<p ) //count only useful surprises
				surprises++;			
		}
		
		int pScores = 0;
		 
		for(int i=0;i<scores.size();i++)
		{
			if (getMaxScoreNoSuprise(scores.get(i))>=p )
				pScores++;			
		}
		
		return surprises + pScores;
	}

}
