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.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;


public class ProblemB {
	
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(new File("/Users/phan/Downloads/B-large.in"));
		PrintWriter pw = new PrintWriter("/Users/phan/Downloads/outputLarge");
		int test = scanner.nextInt();
		
		for (int i = 1; i <= test; i++) {
			int n = scanner.nextInt();
			int s = scanner.nextInt();
			int p = scanner.nextInt();
			int[] scores = new int[n];
			for (int j = 0; j < n; j++)
				scores[j] = scanner.nextInt();
			
			Arrays.sort(scores);
			
			int cnt = 0;
			
			for (int j = n - 1; j >= 0; j--) {
				int[] t = new int[3]; 
				t[0] = scores[j] / 3;
				t[1] = t[0] + (scores[j] % 3) / 2;
				t[2] = t[0] + (scores[j] % 3 + 1) / 2;
				
				//System.out.println(t[0] + " " + t[1] + " " + t[2]);
				
				if (t[2] >= p) {
					cnt++;
				} 
				else {
					if (t[2] == p - 1) {
						if ((t[1] > 0) && (t[1] == t[2])) {
							if (s > 0) {
								cnt++;
								s--;
							}
							else {
								break;
							}
						}
					}
				}
			}
			
						
			pw.println("Case #" + String.valueOf(i) + ": " + String.valueOf(cnt));
		}
		
		scanner.close();
		pw.close();

	}


}
