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

/**
 * GoogleDancers Class
 * 
 * @author ndiwan
 * 
 */
public class GoogleDancers {

	/**
	 * Main method for calculating best results of Google dancers
	 * 
	 * @param args
	 */
	public static void main(String[] args) {

		int testCases;
		int googlers;
		int surprising;
		int cutOff;
		int[] marks;
		int bestResult = 0;

		BufferedWriter bw = null;
		Scanner scan = null;

		try {

			bw = new BufferedWriter(new FileWriter("Output.txt"));
			scan = new Scanner(new File("Input.txt"));

			testCases = scan.nextInt();

			for (int i = 1; i <= testCases; i++) {

				googlers = scan.nextInt();
				surprising = scan.nextInt();
				cutOff = scan.nextInt();
				bestResult = 0;

				marks = new int[googlers];

				// storing marks for googlers
				for (int j = 0; j < googlers; j++) {
					marks[j] = scan.nextInt();
				}

				// processing marks in triplets
				for (int k = 0; k < marks.length; k++) {

					int div = marks[k] / 3;
					int rem = marks[k] % 3;

					if (div != 0) {
						if (div >= cutOff) {
							++bestResult;
						} else {
							if (cutOff - div == 1) {
								if (rem >= 1) {
									++bestResult;
								} else if (surprising > 0) {
									++bestResult;
									--surprising;
								}
							}
							if (cutOff - div == 2 && rem > 1 && surprising > 0) {
								++bestResult;
								--surprising;
							}
						}
					}
					else {
						if (cutOff == 0 || rem >= cutOff){
							++bestResult;
						}
						else if (rem >= cutOff && surprising > 0) {
							++bestResult;
							--surprising;
						}
					}
				}

				bw.write("Case #" + i + ": " + bestResult + "\n");
			}

		} catch (Exception e) {
			System.out.println("Exception " + e);
			e.printStackTrace();
			
		} finally {
			scan.close();
			try {
				bw.close();
			} catch (Exception e) {
				e.printStackTrace();
			}
		}
	}
}