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.util.*;
import java.io.*;

public class QR_Blarge {
	public static void main(String[] args) throws Exception{
		// Scanner sc = new Scanner(System.in);
		// PrintWriter pw = new PrintWriter(System.out);
		// Scanner sc = new Scanner(new FileReader("input.in"));
		// PrintWriter pw = new PrintWriter(new FileWriter("output.out"));
		Scanner sc = new Scanner(new FileReader("B-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B-large.out"));
		
		
		int T;
		
		int N, S, p;
		int[] t = new int[100];
		int ans;
		
		T = sc.nextInt();
		
		for(int times = 1; times <= T; times++){
			N = sc.nextInt();
			S = sc.nextInt();
			p = sc.nextInt();
			
			for(int i = 0; i < N; i++){
				t[i] = sc.nextInt();
			}
			
			ans = 0;
			
			for(int i = 0; i < N; i++){
				if(t[i] <= 1){
					if(p <= t[i]){
						ans++;
					}
					continue;
				}
				t[i] = t[i] - (p * 3);
				if(t[i] > -3){
					ans++;
				}else if(t[i] > -5 && S > 0){
					ans++;
					S--;
				}
			}
			
			System.out.print("Case #" + times + ": ");
			System.out.print(ans);
			System.out.println();
			
			
			pw.print("Case #" + times + ": ");
			pw.print(ans);
			pw.println();
			
		}
		
		sc.close();
		pw.close();
		
	}
}

