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.security.AlgorithmConstraints;
import java.util.Scanner;
import java.util.StringTokenizer;


public class Numbers {

	static int count =0;
	static int max;
	static int surprise;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int testCases = Integer.parseInt(sc.nextLine().trim());
		for(int i=1;i<=testCases;i++){
			String line = sc.nextLine();
			StringTokenizer st = new StringTokenizer(line);
			int persons = Integer.parseInt(st.nextToken());
			surprise = Integer.parseInt(st.nextToken());
			max = Integer.parseInt(st.nextToken());
			count =0;
			if(max == 0){
				System.out.println("Case #"+i+": "+persons);
			}else{
				for(int j=0;j<persons;j++){
					algorithm(Integer.parseInt(st.nextToken()));
				}
				System.out.println("Case #"+i+": "+count);
				}
		}

	}
	public static void algorithm(int current){
		if(current ==0){
			return;
		}
		int div = current/3;
		if(current%3==0){
			if(div >=max){
				count++;
			}else if(surprise>0 && (div+1) >=max){
				count++;
				surprise--;
			}
		}else if(current%3==1){
			if((div+1) >=max){
				count++;
			} 
		}else if(current%3==2){
			if((div+1) >=max) count++;
			else if(surprise>0 && (div+2)>=max){
				count++;
				surprise--;
			}
		}
	}

}
