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 B{
	void solve() throws FileNotFoundException{
		File fin = new File("data.in");
		File fout = new File("data.out");
		Scanner cin = new Scanner(fin);
		PrintWriter cout = new PrintWriter(fout);
		
		int T, n, s, p;
		T = cin.nextInt();
		for(int k = 0; k < T; k++){
			n = cin.nextInt(); s = cin.nextInt(); p = cin.nextInt();
			int [] num = new int[n];
			for(int i = 0; i < n; i++)  num[i] = cin.nextInt();
			int ans = 0;
			for(int i = 0; i < n; i++){
				if(num[i]/3>=p || (num[i]%3>0 && num[i]/3+1>=p)){
					ans++;
					continue;
				}
				if(num[i]%3==2 && num[i]/3+2>=p && s>0){
					s--;
					ans++;
				}
				if(num[i]%3==0 && num[i]/3+1>=p && num[i]/3>0 && s>0){
					s--;
					ans++;
				}
			}
			cout.printf("Case #%d: %d\n", k+1, ans);
		}
		
		cout.flush();
	}
	public static void main(String [] args) throws Exception{
		B test = new B();
		test.solve();
	}
}












