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.ArrayList;
import java.util.Collections;
import java.util.Scanner;


public class b {
	public static void main(String[] args){
		new b().go();
	}

	private void go() {
		Scanner in=new Scanner(System.in);
		int numc=in.nextInt();
		for(int cnum=1;cnum<=numc;cnum++){
			int n=in.nextInt(),s=in.nextInt(),p=in.nextInt();
			ArrayList<Integer>a=new ArrayList<Integer>();
			for(int i=0;i<n;i++)a.add(in.nextInt());
			Collections.sort(a,Collections.reverseOrder());
			int count=0;
			for(int i:a){
				if((i+2)/3>=p&&i>=p)count++;
				else if(s>0&&(i+4)/3>=p&&i>=p){
					count++;
					s--;
				}
			}
			System.out.printf("Case #%d: %d\n", cnum,count);
		}
	}

}