import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class DancingGooglers {
	
	public static int num (int c,int p,int [] g){
		int n = 0;
		for (int i =0;i<g.length;i++){
			if (g[i]>=p+p+p-2){
				n++;
			}
			else if (g[i]>=p+p+p-4){
				if (c>0){
					n++;
					c--;
				}
			}
		}
		return n;
	}
	
	public static void main (String [] args) throws NumberFormatException, IOException{
		BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
		int t = Integer.parseInt(br.readLine());
		for (int i =0;i<t;i++){
			StringTokenizer s1 = new StringTokenizer(br.readLine());
			int [] g = new int [Integer.parseInt(s1.nextToken())];
			int c = Integer.parseInt(s1.nextToken());
			int p = Integer.parseInt(s1.nextToken());
			for (int j =0;j<g.length;j++){
				g[j] = Integer.parseInt(s1.nextToken());
			}
			if (p>1){
				System.out.printf("Case #%d: %d\n",i+1,num(c,p,g));
			}
			else {
				int n = 0;
				for (int j =0;j<g.length;j++){
					if (g[j]>=p+p+p-2){
						n++;
					}
				}
				System.out.printf("Case #%d: %d\n",i+1,n);
			}
		}
	}
}
