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 qual1;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;

public class B {
	public static void main(String[] args) throws IOException {
		for (int i=0; i<=10; i++) {
			System.out.println(Math.max((i-2)+(i-2)+i,i));
		}
		
		
		// Use BufferedReader rather than RandomAccessFile; it's much faster
		BufferedReader f = new BufferedReader(new FileReader("B-small-attempt4.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-small-attempt4.out")));

		HashMap<Integer, ArrayList<String>> debug = new HashMap<Integer, ArrayList<String>>();

		int cases = Integer.parseInt(f.readLine());
		for (int zz = 1; zz <= cases; zz++) {
			String x = f.readLine();
			StringTokenizer st = new StringTokenizer(x);
			int n = Integer.parseInt(st.nextToken());
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());  //At least p for BEST score.
			int[] points = new int[n];
			int ans = 0;

			// Assume p = 5
			int magicNum = Math.max((p - 2) + (p - 2) + p,p); // 3 3 5 or 3 4 5
			// magicNum and MagicNum+1 are always be surprising

			// 3 5 5 or 4 4 5
			// magicNum+2 may be surprising or not.

			//p=0 -2 -2 0
			//p=1 -1 -1 1
			//p=2  0  0 2
			//p=3  1  1 3
			//p=4  2  2 4 
			
			for (int xx = 0; xx < n; xx++) {
				points[xx] = Integer.parseInt(st.nextToken());
				
				if (p==0 || p==1) {
					if (points[xx]>=p)
						ans++;
					continue;
				}
				
				if (s > 0 && (points[xx] == magicNum || points[xx] == magicNum + 1)) {
					s--;
					ans++;
				} else if (points[xx] >= magicNum + 2) {
					ans++;
				}
			}
			out.println("Case #" + zz + ": " + ans);

		}

		out.close(); // close the output file
		System.exit(0); // don't omit this!
	}

}