import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

package er.dream.codejam.train;

import java.util.ArrayList;
import java.util.List;

import er.dream.codejam.helpers.ProblemSolver;

public class DancingWithGooglers extends ProblemSolver{
	
	public static void main(String[] args) {
		new DancingWithGooglers().execute();
	}

	@Override
	protected List<String> handleInput() {
		List<String> result = new ArrayList<String>();
		int[] settings = fileHandler.readIntArray();
		
		for(int i=0;i<settings[0];i++){
			int[] numbers = fileHandler.readIntArray();
			int surprises = numbers[1];
			int minScore = numbers[2];
			
			int minimumScoreForUnsurprising = Math.max(0,3*minScore-2);
			int minimumScoreForSurprising = Math.max(0, 3*minScore-4);
			
			int surprisesMax = 0;
			int unsuprising = 0;
			
			int score;
			for(int j=3;j<numbers.length;j++){
				
				score = numbers[j];
				if(score < minScore)
					continue;
				
				if(score >= minimumScoreForUnsurprising)
					unsuprising++;
				else if(score >= minimumScoreForSurprising)
					surprisesMax++;
			}
			int maxGooglers = unsuprising + Math.min(surprises,  surprisesMax);
			result.add(""+maxGooglers);
		}
		
		return result;
	}

}
