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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class Googlers {

	static public int min(int a, int b){
		return a < b ? a : b;
	}
	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		File f = new File( "B-large.in" );
		FileWriter out=new FileWriter("output.txt");

		Scanner in = new Scanner(new FileReader(f));

		if(f.exists()){
			int T;
			int N, S, p;
			int[] t = new int[100];
			
			T = in.nextInt();
			
			for(int i = 1; i <= T; i++){
				
				N = in.nextInt();
				S = in.nextInt();
				p = in.nextInt();
				
				int sup = 0;
				int litige = 0;
				
				for(int j = 0; j < N ; j++)
					t[j] = in.nextInt();
				
				for(int j = 0; j < N ; j++){
					if(t[j] >= 3*p-2)
						sup++;
					else
						if(t[j] >= 3*p-4 && 3*p-4 >= 0)
							litige++;
					

				}
				out.write("Case #" + i +": " + (sup+ min(S, litige))+ "\n");
			
			
			}
		}

		in.close();
		out.close();

		
	}
}
