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();
	}
}

public class DataModel extends Thread {
		
		private int googlersNo;
		private int suprScore;
		private int minScore;
		private int[] googScore;
		private int caseNo;
		private int output;
		private boolean stateCalc;
		
		public DataModel(String input, int caseNo) {
			this.caseNo = caseNo;
			String[] temp = input.split(" ");
			stateCalc = false;
			try {
				googlersNo = Integer.parseInt(temp[0]);
				suprScore = Integer.parseInt(temp[1]);
				minScore = Integer.parseInt(temp[2]);
				googScore = new int[googlersNo];
				for(int i = 0;i<googlersNo;i++) {
					googScore[i] = Integer.parseInt(temp[3+i]);
				}
			} catch (Exception e) {
				e.printStackTrace();
				System.exit(1);
			}
		}
		
		private boolean isOverReqScore(int i) {
			int[] temp = {i/3,i/3,i/3};
			int diff = (i-(temp[0]+temp[1]+temp[2]));
			int minDiff = minScore-temp[0];
			if(diff > 0) {
				temp[0] += 1;
				if(diff > 1 && minDiff < 3 && minDiff > 0 && suprScore > 0) {
					temp[0] += 1;
					suprScore--;
				} else if(diff > 1) {
					temp[1] += 1;
				} 
			} else if (minDiff == 1 && temp[0]!=0 && suprScore > 0) {
				temp[0] += 1;
				temp[2] -= 1;
				suprScore--;
			}
			return (temp[0]>=minScore||temp[1]>=minScore||temp[2]>=minScore);
		}
		
		@Override
		public void run() {
			for(int i = 0;i<googlersNo;i++) {
				if(isOverReqScore(googScore[i])) {
					output++;
				}
			}
			stateCalc = true;
		}
		
		public boolean isDone() { 
			return stateCalc;
		}
		
		public void getOutput() {
			System.out.println("Case #"+caseNo+": "+output);
		}
	}