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


public class GooglersDancing {
	
	public static int[][] array = new int[11][4];
	
	public void generateArray() {
		for (int i=0;i<=10; i++) {
			array[i][0] = Integer.MAX_VALUE;
			array[i][2] = Integer.MAX_VALUE;
			array[i][1] = Integer.MIN_VALUE;
			array[i][3] = Integer.MIN_VALUE;
			//ArrayList<Integer> possibleList = new ArrayList<Integer>();
			for (int j=i-2; j<=i+2 ; j++) {
				if (j>=0 && j<=10) {
					if (Math.abs(j-i) < 2) {
						if (array[i][2] > (j+j)) {
							array[i][2] = j+j;
						}
						else if (array[i][3] < (j+j)) {
							array[i][3] = j+j;
						}
						if (array[i][0] > (j+j)) {
							array[i][0] = j+j;
						}
						else if (array[i][1] < (j+j)) {
							array[i][1] = j+j;
						}
					}
					else {
						if (array[i][0] > (j+j)) {
							array[i][0] = j+j;
						}
						else if (array[i][1] < (j+j)) {
							array[i][1] = j+j;
						}
					}
				}
			}
		}
	}
	
	public static void main(String[] args) {
		GooglersDancing g = new GooglersDancing();
		g.generateArray();
		for (int i=0; i<=10; i++) {
			System.out.println(i + ":" + array[i][0] + "*" + array[i][1] + "*" + array[i][2] + "*" + array[i][3] + "*");
		}
		
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		int cases=1;
		while (cases <= T) {			
			int N,S,p, count=0;
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();
			while (N-->0) {
				boolean inRange=false, outRange=false;
				int t = in.nextInt();
				int p2 = p;
				while (p2<=10) {
					int sum = t-p2;
					if (sum >= array[p2][2] && sum <= array[p2][3]) {
						inRange = true;
						break;
					}
					else if (sum >= array[p2][0] && sum <= array[p2][1]) {
						outRange = true;
					}
					p2++;
				}
				if (inRange) {
					count++;
				}
				else if (outRange && S>0) {
					count++;
					S--;
				}
			}
			System.out.println("Case #" + cases + ": " + count);
			cases++;
		}
	}

}
