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.io.*;
import java.util.Scanner;

public class B {

public static void main(String[] args) throws FileNotFoundException, IOException {
        Scanner sc = new Scanner(new FileReader("input.txt"));
     PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));

        int noOfCases = sc.nextInt();

for (int caseNum = 0; caseNum < noOfCases; caseNum++){
	int noOfGooglers = sc.nextInt();
	int supprizing = sc.nextInt();
	int bestScore = sc.nextInt();
	int scores[] = new int[noOfGooglers];
	int result = 0;
	for (int i = 0; i < noOfGooglers; i++) {
		scores[i] = sc.nextInt();
	}
	
	int suppLowest = ((bestScore-1)*3)-1;
	int normLowest = (bestScore*3)-2;
	
	for (int i = 0; i < scores.length; i++) {
		if(scores[i]==0){
			if(bestScore==0){
				result++;
			}
		}
		else if(scores[i]>=normLowest){
			result++;
		}
		else if(scores[i]>=suppLowest){
			if(supprizing>0){
				result++;
				supprizing--;
			}
		}
		
	}
	
     pw.print("Case #" + (caseNum + 1) + ": " + result);
     
     if(caseNum < noOfCases-1)
     	pw.println("");
}
     

     pw.flush();
     pw.close();
     sc.close();
}
}

