import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

package qualifyingRound;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class DancingWithGooglers {
	public static void main (String [] args) throws FileNotFoundException
	{
		Scanner in = new Scanner (new File ("input.txt"));
		int numLines = Integer.parseInt(in.nextLine());
		int caseNum = 1;
		for (int j = 0; j < numLines; j++)
		{	
			System.out.print("Case #" + caseNum + ": ");
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int noSup = 0;
			int sup = 0;
			for (int i = 0; i < n; i++)
			{
				int total = in.nextInt();
				int maxNoSup = maxNoSup(total);
				int maxSup = maxSup(total);
//				System.out.println(total + " " + maxNoSup + " " + maxSup);
				if (maxNoSup >= p)
					noSup++;
				else if (maxSup >= p)
					sup++;
			}
			int temp = s - sup;
			if (temp <= 0)
				System.out.println((noSup + s));
			else
				System.out.println((noSup + (sup)));
			caseNum++;
		}
	}
	private static int maxNoSup(int totalScore)
	{
		int i = totalScore % 3;
		switch (i)
		{
		case 0: return totalScore/3;
		case 1: return totalScore/3 + 1;
		default: return totalScore/3 + 1;
		}
	}
	private static int maxSup(int totalScore)
	{
		if (totalScore == 0)
			return 0;
		int i = totalScore % 3;
		switch (i)
		{
		case 0: return totalScore/3 + 1;
		case 1: return totalScore/3 + 1;
		default: return totalScore/3 + 2;
		}
	}
}
