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 wangshu.codejam.google.com;

import java.io.File;
import java.io.FileWriter;
import java.util.*;
import java.util.regex.*;

public class QB {

	/**
	 * @param args
	 */
	public static int calculateNumber(int S, int p, int[] t){
		
		int yes=0, maybe=0;
		int temp; // temp is the higher value of p-1 or p-2 compared with 0;
		
		// For each Googler, calculate result
		for(int i=0; i<t.length; i++){
			temp = ((p-1)>0) ? p-1:0;
			if (t[i]-p-temp*2 >= 0){
				yes++;
			}else{ 
				temp = ((p-2)>0) ? p-2:0;
				if (t[i]-p-temp*2 >=0)
				maybe++;
			}
		}
		
		if(maybe > S){
			maybe = S;
		}
		
		return yes+maybe ;
	}
	
	public static void main(String[] args) throws java.lang.Exception{

		Scanner sc_line = new Scanner(new File("qb_in_small.txt"));  // Line scanner for input file
		Scanner sc_int; // Integer scanner for each line
		sc_line.useDelimiter(Pattern.compile("[\\p{javaWhitespace}]+"));
		String line;
		int T; // Number of test cases
		int N, S, p;
		int[] t;
		FileWriter outputFile = new FileWriter("qb_out_small.txt");  // Output file
		
		// Read number of test cases
		T = sc_line.nextInt(); 
		sc_line.nextLine();
		
		// Read each test case
		for(int i=0; i<T; i++){
			line = sc_line.nextLine();
			sc_int = new Scanner(line);
			N = sc_int.nextInt();
			S = sc_int.nextInt();
			p = sc_int.nextInt();
			t = new int[N];
			for(int j=0; j<N; j++){
				t[j] = sc_int.nextInt();
			}
			
			System.out.println("Case #" + (i+1) + ": " + calculateNumber(S, p, t));
			outputFile.write("Case #" + (i+1) + ": " + calculateNumber(S, p, t)+"\r\n");
		}
		outputFile.flush();
	}

}
