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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class Dancing {
	
	public static void main(String args[]) throws NumberFormatException, IOException{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(in.readLine());
		int t = 0;
		String str = "";
		String regex = " ";
		String[] split;
		String[] result = new String[T+1];
		int N = 0;
		int S = 0;
		int p = 0;
		for(int x = 1; x <= T; x++){
			str = in.readLine();
			split = str.split(regex);
			N = Integer.parseInt(split[0]);
			S = Integer.parseInt(split[1]);
			p = Integer.parseInt(split[2]);
			for(int y = 3; y < (3 + N); y++ ) {
				if(bestScore(N, S, p, Integer.parseInt(split[y])) == 1) {
					t++;
				}
				if(bestScore(N, S, p, Integer.parseInt(split[y])) == 2) {
					S--;
					t++;
				}
			}
			
			result[x] = "Case #" + x + ": " + t;
			t=0;
		}
		for(int u = 1; u <= T; u++){
			System.out.println(result[u]);
		}
		
	}
	
	public static int bestScore (int N, int S, int p, int t){
		int work = 0;
		int temp = t;
		int score;
		int special = 2;
		if(S != 0){
			for(score = 10; score > 0; score--){
				
				if(t - score >= (score - special)*(2) && (t-score > 0)) {
					temp = score;
					score = -1;
				}
			}
			if(temp >= p)
			{
				work = 2;
				
			}
		}
		temp = t;
		special = 1;
		for(score = 10; score >= 0; score--){
		
			if(t - score >= (score - special)*(2) && (t-score > 0)) {
				temp = score;
				score = -1;
			}
		}
		if(temp >= p)
		{
			work = 1;
			
		}
		return work;
		
	}

}
