import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
package Codejam;

import java.util.HashMap;
import java.util.Scanner;

public class CodeJamB {
	public static void main(String args[]){
		
		Scanner scn = new Scanner(System.in);
		int t = scn.nextInt();
		int n;
		int s;
		int p;
		int triplet;
		int result;
		int score;

	
		for(int i = 0; i < t; i++){
			n = scn.nextInt();
			s = scn.nextInt();
			p = scn.nextInt();
			triplet = 0;
			result = 0;
			
			for(int j = 0; j < n; j++){
				score = scn.nextInt();
				if(score > ((p * 3) - 3)){
					result ++;
				}else if(score > 2 && score > ((p * 3) - 5) && triplet < s){
					result ++;
					triplet ++;
				}


			}
			
			System.out.println("Case #" + ( i + 1 ) + ": " + result);
			
		}
	}
}
