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

public class Test2 {

	final static String INPUT_FILE_NAME = "input2";

	int T = 0;
	int q = 0;

	public static void main(String args[]) {
		try {
			Test2 tst = new Test2();
			tst.getInput();
		}
		catch (Exception e) {
			e.printStackTrace();
		}
	}

	private void getInput() throws Exception {
		File file = new File(INPUT_FILE_NAME);
		FileReader fis = new FileReader(file);
		BufferedReader br = new BufferedReader(fis);
		String strT = br.readLine();
		T = getInt(strT);

		for (int i=0; i<T; i++) {
			String strHead = br.readLine();
			String[] strHairetsu = strHead.split(" ");
			int N = getInt(strHairetsu[0]);
			int S = getInt(strHairetsu[1]);
			int P = getInt(strHairetsu[2]);
			int[] t = new int[N];
			for (int j=0; j<N; j++) {
				t[j] = getInt(strHairetsu[3+j]);
			}

			//list kakunou
			execuse(i, N, S, P, t);
		}
	}

	private void execuse(int num, int N, int S, int P,int[] t) {

		int count =0;
		for (int i=0; i<N; i++) {
			int mod3 =t[i] % 3;
			if (mod3==0) {
				if (t[i] == 0) {
					if (P==0) {
						count++;
					}
				} else if (t[i]/3 >= P) {
					count++;
				} else if ((t[i]/3 >= (P-1)) && S>0) {
					S--;
					count++;
				} 
			} else if (mod3 ==2) {
				if (t[i]/3 >= P-1) {
					count++;
				} else if ((t[i]/3 >= (P-2)) && S>0) {
					S--;
					count++;
				} 
			} else {
				if (t[i]/3 >= P-1) {
					count++;
				}
			}
		}


		System.out.println("Case #"+(num+1)+": "+count);
		//System.out.println("Hello WorldI");
	}

	private int getInt(String a) {
		return Integer.parseInt(a, 10);
	}

	private int getIntx(String a) {
		if (a.equals(".")) {
			return 0;
		}
		return 1;
	}

}
