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.util.Scanner;

public class GooglerDance {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int size = in.nextInt();
		int count = 0;
		while (count < size) {
			int maxNum = 0;
			int googlers = in.nextInt();
			int[][] judges = new int[googlers][3];
			int[] scores = new int[googlers];
			boolean[] ishigher = new boolean[googlers];
			int s = in.nextInt();
			int p = in.nextInt();
			for (int i = 0; i < scores.length; i++) {// getting scores
				scores[i] = in.nextInt();
			}
			// computing scores
			for (int i = 0; i < scores.length; i++) {
				int ceil = scores[i] / 3;
				if ((scores[i] % 3) > 0) {
					ceil++;
				}
				if (ceil >= p) {
					ishigher[i] = true;
					maxNum++;
				}
				if ((3 * ceil) == scores[i]) {
					judges[i][0] = ceil;
					judges[i][1] = ceil;
					judges[i][2] = ceil;
					if (!ishigher[i] && (p - ceil) == 1 && s > 0
							&& (ceil - 1) > 0) {
						judges[i][0] = ceil + 1;
						judges[i][1] = ceil;
						judges[i][2] = ceil - 1;
						maxNum++;
						s--;
					}
				} else if ((3 * ceil) == (scores[i] + 1)) {
					judges[i][0] = ceil;
					judges[i][1] = ceil;
					judges[i][2] = ceil - 1;
					if (!ishigher[i] && (p - ceil) == 1 && s > 0
							&& (ceil - 1) > 0) {
						judges[i][0] = ceil + 1;
						judges[i][1] = ceil - 1;
						judges[i][2] = ceil - 1;
						maxNum++;
						s--;
					}
				} else if ((3 * ceil) == (scores[i] + 2)) {
					judges[i][0] = ceil;
					judges[i][1] = ceil - 1;
					judges[i][2] = ceil - 1;

				} else {
					System.out.println("Error in Algorithm");
				}
			}
			System.out.format("Case #%d: %d\n", count + 1, maxNum);
			count++;
		}
	}
}
