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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Dancing {

	public static void main(String[] s){
		doIt();
	}

	private static void doIt() {
		Scanner s=null;
		try {s = new Scanner(new File("B-large.in"));}
		catch (FileNotFoundException e) {e.printStackTrace();}
		
		PrintWriter out=null;
		try {out = new PrintWriter(new FileWriter("a.out"));} 
		catch (IOException e) {e.printStackTrace();}
		
		int cases=s.nextInt();
		
		for(int idx=0;idx<cases;idx++){
			int number=s.nextInt();
			int surprising=s.nextInt();
			int targetScore=s.nextInt();
			int valid=0;
			for(int idy=0;idy<number;idy++){
				int current=s.nextInt();
				
				if(current%3==0 && current/3>=targetScore) valid++;
				else if(current%3!=0 && current/3+1>=targetScore) valid++;

				else if(surprising>0 && current/3+1==targetScore  && current>1){
					surprising--;
					valid++;
				} 
				else if(surprising>0 && current%3==2 && current/3+2==targetScore){
					surprising--;
					valid++;
				} 
				
			}
			
			int index=idx+1;
			out.println
			("Case #"+index+": "+valid);
		}
		
		
		out.close();
	}
}
