package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

package Qualification;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.StringTokenizer;

public class ProblemB {
	int good;
	int needsSuprise;
	int bad;
	int p;
	public ProblemB() throws IOException {
		BufferedWriter out = new BufferedWriter(new FileWriter(new File("out.txt")));
		//Scanner scanner = new Scanner(System.in);
		Scanner scanner = new Scanner(new File("in.txt"));
		int T = Integer.parseInt(scanner.nextLine());
		for(int i=1;i<=T;i++) {
			good = needsSuprise = bad = 0;
			StringTokenizer tokens = new StringTokenizer(scanner.nextLine());
			int numGooglers = Integer.parseInt(tokens.nextToken());
			int suprises = Integer.parseInt(tokens.nextToken());
			p = Integer.parseInt(tokens.nextToken());
			for(int j=0;j<numGooglers;j++) {
				int totalPoints = Integer.parseInt(tokens.nextToken());
				analyze(totalPoints);
			}
			
			int solution = good + Math.min(needsSuprise,suprises);
			System.out.println("Case #" + i + ": " + solution);
			out.write("Case #" + i + ": " + solution + "\n");
		}
		out.close();
	}
	
	public void analyze(int totalPoints) {
		int score = (totalPoints+1)/3;
		int diffScore = totalPoints - score*2;
		if(score>=p || diffScore>=p) {
			good++;
			return;
		}
		if(totalPoints>=2 && (score+1>=p || diffScore+1>=p)) {
			needsSuprise++;
			return;
		}
		bad++;
	}
	
	public static void main(String args[]) throws IOException {
		new ProblemB();
	}
}
