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

package dance;

import java.util.*;

public class dance {
	public static void main(String[] args){
		Scanner input = new Scanner(System.in);
		int T = input.nextInt();
		for(int l=0;l<T;l++){
			int n = input.nextInt();
			int s = input.nextInt();
			int p = input.nextInt();
			int t[] = new int[n];
			int score[][] = new int[n][3];
			int max[] = new int[n];
			boolean flag = false;
			int ans = 0;
			for(int i=0;i<n;i++){
				t[i] = input.nextInt();
				if(t[i]%3==0){
					score[i][0] = t[i]/3;
					score[i][1] = t[i]/3;
					score[i][2] = t[i]/3;
					max[i] = t[i]/3;
					flag = true;
				}
				else if(t[i]%3==1){
					score[i][0] = t[i]/3;
					score[i][1] = t[i]/3;
					score[i][1] = t[i]/3 + 1;
					max[i] = t[i]/3 + 1;
					flag = false;
				}
				else{
					score[i][0] = t[i]/3;
					score[i][1] = t[i]/3 + 1;
					score[i][2] = t[i]/3 + 1;
					max[i] = t[i]/3 + 1;
					flag = true;
				}
				if(max[i]>=p){
					//System.out.println("max  for "+t[i]+" is "+max[i]);
					ans++;
				}
				else if(flag && p-max[i] == 1 && s>0){
					if(!(t[i]%3==0 && t[i]/3==0)){
						ans++;
						s--;
					}
				}
			}
			System.out.println("Case #"+(l+1)+": "+ans);
		}
	}

}
