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

public class B
{
	public static void main(String[] args) throws Exception
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int numCases = Integer.parseInt(br.readLine());
		
		for(int i = 0; i < numCases; i++) {
			solveCase(i+1, br.readLine());
		}
	}
	
	private static void solveCase(int caseNum, String line) {
		String[] parts = line.split(" ");
		int numGooglers = Integer.parseInt(parts[0]);
		int numSurprising = Integer.parseInt(parts[1]);
		int minScore = Integer.parseInt(parts[2]);
		
		ArrayList<Integer> scores = new ArrayList<Integer>(numGooglers);
		for(int i = 0 ;i < numGooglers; i++) {
			scores.add(Integer.parseInt(parts[i+3]));
		}
		
		//System.out.println(numSurprising +" surprising");
		//System.out.println("scores: "+ scores);
		
		System.out.println("Case #"+caseNum+": "+solve(minScore, scores, 0, numSurprising, 0));
	}
	
	private static int solve(int minScore, ArrayList<Integer> scores, int index, int surprisesRemaining, int result) {
		if(index == scores.size()) {
			return result;
		}
		
		if(solveWithoutSurprise(minScore, scores.get(index))) {
			result++;
		} else if(surprisesRemaining > 0 && solveWithSurprise(minScore, scores.get(index))) {
			result++;
			surprisesRemaining--;
		}
		
		return solve(minScore, scores, index + 1, surprisesRemaining, result);
	}
	
	private static boolean solveWithoutSurprise(int minScore, int totalScore) {
		if(minScore ==0) {
			return true;
		}
		if(totalScore == 0) {
			return false;
		}
		
		int scoresTo = totalScore - 1;
		int each = scoresTo / 3;
		if(each + 1 >= minScore) {
			return true;
		}
		return false;
	}
	
	private static boolean solveWithSurprise(int minScore, int totalScore) {
		if(totalScore == 0) {
			return false;
		}
		
		int scoresTo = totalScore - 2; // if total score was < 2, would have been true from WithoutSurprise
		int each = scoresTo / 3;
		int remainder = scoresTo % 3;
		if(remainder == 0 || remainder == 1) {
			if(each + 2 >= minScore) {
				return true;
			}
			return false;
		} else { // remainder ==2 
			//System.out.println("totalScore="+totalScore+": SHOULD NEVER HAPPEN!!!!!!!!!!!! SHOULD ALWAYS BE ABLE TO SOLVE WIHTOUT SURPIRSE!!!");
		}
		return false;
	}
}