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

public class Dancing{
	
	public static void main(String args[]){
		
		try{
			
			FileInputStream fstream = new FileInputStream(args[0]);
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			
			PrintWriter out = new PrintWriter(args[0] + "_out");
			
			String strLine = br.readLine();
			int cases = Integer.parseInt(strLine);
				
			for (int i = 0; i < cases; i++){
				
				strLine = br.readLine();
				String[] this_literals = strLine.split(" ");
				int[] this_line = new int[this_literals.length];
				for (int j = 0; j < this_literals.length; j++) this_line[j] = Integer.parseInt(this_literals[j]);
				
				int number_of_googlers = this_line[0];
				int number_of_surprises = this_line[1];
				int best_result = this_line[2];
				
				int candidates = 0;
				
				for (int googler = 0; googler < number_of_googlers; googler++){
					
					int unsurprising = 0;
					int surprising = 0;
					
					for (int score1 = 0; score1 <= 10; score1++){
						for (int score2 = 0; score2 <= 10; score2++){
							for (int score3 = 0; score3 <= 10; score3++){
								
								if (score1 + score2 + score3 == this_line[googler+3] &&
									score1 - score2 < 2 && score1 - score2 > -2 &&
									score2 - score3 < 2 && score2 - score3 > -2 &&
									score1 - score3 < 2 && score1 - score3 > -2){ 
									System.out.println("case " + i + " googler " + googler + " score1 " + score1 + " score2 " + score2 + " score3 " + score3);
									if (Math.max(score1,Math.max(score2,score3)) >= best_result) unsurprising++;
									}
									
								if (score1 + score2 + score3 == this_line[googler+3] &&(
									((score1 - score2 == 2 | score1 - score2 == -2) &&
									score2 - score3 < 2 && score2 - score3 > -2 &&
									score1 - score3 < 2 && score1 - score3 > -2)
									|
									(score1 - score2 < 2 && score1 - score2 > -2 &&
									(score2 - score3 == 2 | score2 - score3 == -2) &&
									score1 - score3 < 2 && score1 - score3 > -2)
									|
									(score1 - score2 < 2 && score1 - score2 > -2 &&
									score2 - score3 < 2 && score2 - score3 > -2&&
									(score1 - score3 == 2 | score1 - score3 == -2)))
									
									|
									
									(
									((score1 - score2 == 2 | score1 - score2 == -2) &&
									(score2 - score3 == 2 | score2 - score3 == -2) &&
									score1 - score3 < 2 && score1 - score3 > -2)
									|
									(score1 - score2 < 2 && score1 - score2 > -2 &&
									(score2 - score3 == 2 | score2 - score3 == -2) &&
									(score1 - score3 == 2 | score1 - score3 == -2))
									|
									((score1 - score2 == 2 | score1 - score2 == -2) &&
									score2 - score3 < 2 && score2 - score3 > -2&&
									(score1 - score3 == 2 | score1 - score3 == -2)))){ 
									System.out.println("case " + i + " googler " + googler + " score1 " + score1 + " score2 " + score2 + " score3 " + score3 + "(*)");
									if (Math.max(score1,Math.max(score2,score3)) >= best_result) surprising++;
									}
									
								
							}
						}
					}
					
					if (unsurprising > 0) candidates++;
					else if (surprising > 0 && number_of_surprises > 0){
						candidates++;
						number_of_surprises--;
					}
					
				}
				
				out.println("Case #" + (i+1) + ": " + candidates);
				
				}
				
			
		
			in.close();
			out.close();
			
		}
		
		catch (Exception e){
			System.err.println("Error: " + e.getMessage());
		}
		
	}
		
}
	
