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 info.stephenn.codejam2012.qualify;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class B {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		int cases = sc.nextInt();
		
		for(int caseX=1; caseX <= cases; caseX+=1){
			int nGoogles = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			List<Integer> gTot = new ArrayList<Integer>();
			for (int i = 0; i < nGoogles; i++){
				gTot.add(sc.nextInt());
			}
			int y = doit(gTot, s,p);
			System.out.println("Case #"+caseX+": "+y);
		}
	}
	
	public static int doit(List<Integer> gTot, int s, int p){
		Collections.sort(gTot);
		
		int y=0;
		
		for (int i=0; i < gTot.size(); i++){
			if (greatestNonSurprising(gTot.get(i)) < p){
				if (s > 0){
					if (greatestSurprising(gTot.get(i)) >= p){
						y +=1;
						s -=1;
					}
				}
			} else {
				y += ((gTot.size()) - (i));
				break;
			}
		}
		
		return y;
	}
	
	public static int greatestSurprising(int gTot){
		int x = gTot / 3;
		if ((gTot %3) == 0 && gTot > 2 ) x +=1;
		if ((gTot % 3) == 1) x+=1;
		else if ((gTot % 3) == 2) x+=2;
		return x;
	}
	
	public static int greatestNonSurprising(int gTot){
		int x = gTot/3;
		if ((gTot % 3) > 0) x+=1;
		if (x > 10){
			//shouldnt happen, .
			return 10;
		} else{
			return x;
		}
	}
}