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

}
import java.util.*;
import java.io.*;
public class Googlers {
   public static void main(String[] args)throws IOException {
    Scanner sc = new Scanner(new File("input2.txt"));
    int loop = sc.nextInt();
    int num;
    int s = 0;
    int p;
    int n;
    int count = 0;
    int check;
    
    ArrayList<Integer> array = new ArrayList<Integer>();
    for (int i = 0 ; i < loop ; i++)  {
      num = sc.nextInt();
      s = sc.nextInt();
      p = sc.nextInt();
      for (int j=0 ; j<num ;j++){
        array.add(sc.nextInt());
      }
      n = p*3-2;
      for (Integer in : array){
        if (in >= n)
          count++;
        else {
          if(s>0){
            check = (p+(p-2)*2);
            if(in >= check && check >0){
              count++;
              s--;
            }
          }
        }   
      }
      System.out.println("Case #"+(i+1)+": "+count);
      count = 0;
      array.clear();
    }
    
   }
}