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

class B{
	public static void main(String... arg){
		Scanner sc = new Scanner(System.in);
		
		int cases = sc.nextInt();
		
		for(int caseNo = 1; caseNo <= cases; caseNo++ ){
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			
			int[] t = new int[N];
			int n = 0;
			for(int i = 0; i < N; i++)
					t[i] = sc.nextInt();
			if(p == 0)
				System.out.println("Case #" + caseNo + ": " + N);
			else{
				for(int i = 0; i < N; i++){
					int tmp = ((int)(t[i]/3));
					if(t[i] == 0) tmp = 0;
					else{
						if(t[i] % 3 != 0) tmp = tmp + 1;
					}
					if(tmp >= p) n++;
				}
				if (S == 0)
					System.out.println("Case #" + caseNo + ": " + n);
				else{
					Arrays.sort(t);
					for(int i = N-n-1; i >= 0 && S > 0; i--){
						int tmp = ((int)(t[i]/3));
						if(t[i] == 0) tmp = 0;
						else{
							int rem = t[i] % 3;
							if(rem == 2 && t[i] <= 28) tmp = tmp + 2;
							else if(rem == 0 && t[i] <= 29) tmp = tmp + 1;
							else continue;
						}
						if(tmp >= p) { n++; S--; }
					}
					System.out.println("Case #" + caseNo + ": " + n);
				}
			}
		}
	}
}