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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;


public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner read = new Scanner(new File("B-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new File("b-small.out"));
		int numberOfTests = Integer.parseInt(read.nextLine());
		for (int i = 1; i <= numberOfTests; i++) {
			int result = 0;
			int n = read.nextInt();
			int countSurp = read.nextInt();
			int minScore = read.nextInt();
			int[] totalScores = new int[n];
			for (int j = 0; j < n; j++) {
				totalScores[j] = read.nextInt();
			}
			double[] avg = new double[n];
			for (int j = 0; j < n; j++) {
				avg[j] = totalScores[j] / 3.0;
			}
			for (int j = 0; j < n; j++) {
				if (avg[j] >= minScore) {
					result++;
				} else if (Math.abs(avg[j] - minScore) >= 1.5) {
					continue;
				} else if (Math.abs(avg[j] - Math.round(avg[j])) < 0.3) {
					long t1 = Math.round(avg[j]);
					long t2 = t1;
					long t3 = t2;
					if (countSurp > 0 && t2 >=1) {
						t2--;
						t3++;
						countSurp--;
						result++;
					}
				} else if (avg[j] - Math.round(avg[j]) > 0) {
					long t1 = Math.round(avg[j]);
					long t2 = t1;
					long t3 = t2 + 1;
					if (t3 == minScore) {
						result++;
					}
				} else {
					long t1 = Math.round(avg[j]) - 1;
					long t2 = t1 + 1;
					long t3 = t2;
					if (t3 == minScore) {
						result++;
					} else {
						if (countSurp > 0 && t2 >= 1) {
							countSurp--;
							result++;
							t2--;
							t3++;
						}
					}
				}
			}
			out.println(String.format("Case #%d: %d", i, result));
		}
		out.close();
	}
}
