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

public class dancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scan = new Scanner(System.in);
		int numStrings = scan.nextInt();
		
		for(int i =1; i <= numStrings; i++){
			int numGooglers = scan.nextInt();
			int numSurprises = scan.nextInt();
			int p = scan.nextInt();
			
			int[] totalScores;
			totalScores = new int[numGooglers];
			
			int withoutSurpriseCount, withSurpriseCount;
			withoutSurpriseCount = 0 ;
			withSurpriseCount = 0;
			
			for(int j = 1; j <= numGooglers; j++){
				
				totalScores[j-1] = scan.nextInt();
				
				if(totalScores[j-1] >= p + 2*Math.max(p-1, 0)){
					withoutSurpriseCount = withoutSurpriseCount + 1;
				}
				else if(totalScores[j-1] >= p + 2*Math.max(p-2,0)){
					withSurpriseCount = withSurpriseCount + 1;
				}
			}
			
			//System.out.println("\n " + numGooglers + " " + numSurprises + " " + withoutSurpriseCount + " " + withSurpriseCount);
			
			int temp1 = Math.min(withSurpriseCount, numSurprises);
			int temp2 = temp1 + withoutSurpriseCount;
			int temp3 = Math.min(numGooglers, temp2);
			
			System.out.format("Case #%d: %d\n", i, temp3);
		
		}
	}

}
