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.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;


public class DancingWithGooglers {

	public static void main(String[] args) {
		PrintStream theOut=null;
		try {
			FileOutputStream o = new FileOutputStream("./output.txt", false);
			theOut = new PrintStream(o);
		}
		catch (Exception e) {
			e.printStackTrace();
			return;
		}


		Scanner sc=null;
		try {
			//sc = new Scanner(new File("./A-small.in"));
			sc = new Scanner(new File("/home/duck/Downloads/B-small-attempt0.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		int NbGooglers;
		int max;
		int surprising;
		int nbCases = sc.nextInt();

		mainloop: for(int curCase=1; curCase <= nbCases ;++curCase) {
			sc.nextLine();
			NbGooglers = sc.nextInt();
			surprising = sc.nextInt();
			max = sc.nextInt();
			int res=0;
			for (int i = 0; i < NbGooglers; i++) {
				int tot = sc.nextInt();
				if(tot%3 == 0) {
					if(tot/3 >= max) {res++;continue;}
					if(tot/3+1 >= max && tot >= 3 && surprising >0) {res++;surprising--;continue;}
				}
				else if (tot%3 == 1) {
					if(tot/3+1>= max) res++;
				}
				else if (tot%3 == 2) {
					if(tot/3+1 >= max) {res++;continue;}
					if(tot/3+2 >= max && surprising >0) {res++;surprising--;continue;}
				}
			}


			/*******************************************************************/
			theOut.format("Case #%d: %d\n",curCase,res);
			System.out.format("Case #%d: %d\n",curCase,res);





		}

	}
}
