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.Scanner;


public class BS {

	public static void main(String args[]) {
		Scanner in = new Scanner(System.in);
		
		int count = in.nextInt();
		for (int i = 1; i <= count ; i++) {
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int p_count = 0;
			int s_count = 0;
			for (int j = 0; j < n; j++) {
				int current = in.nextInt();
				int rest = current - p;
				if (rest < 0) {
					continue;
				}
				int restOf2p = rest - (p * 2);
				if (restOf2p >= -2) {
					p_count++;
					continue;
				}
				if (restOf2p >= -4) {
					s_count++;
				}
			}
			if (s_count > s) {
				s_count = s;
			}
			System.out.format("Case #%d: %d\n",i,p_count + s_count);
		}
	}

}

