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;
  }
}

package com.google.codejam;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Dancing {	
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream("B-large.in")));
		PrintWriter writer = new PrintWriter("output.txt");
		int n = Integer.parseInt(reader.readLine());
		for(int i = 1; i <= n; i++) {
			writer.print("Case #" + i + ": " + solve(reader.readLine()));
			writer.println();
		}
		reader.close();
		writer.close();
	}
	
	private static int solve(String line) {
		String[] datas = line.split(" ");
		int n = Integer.parseInt(datas[0]);
		int s = Integer.parseInt(datas[1]);
		int p = Integer.parseInt(datas[2]);
		int count = 0;		
		for (int i = 3; i < n + 3; ++i) {
			int t = Integer.parseInt(datas[i]);
			if (t >= p * 3) {
				++count;
				continue;
			}
			if (t < p) {
				continue;
			}
			int diff = (t - p) / 2;
			if (p - diff <= 1) {
				++count;
				continue;
			}
			if (p - diff == 2 && s > 0) {
				--s;
				++count;
			}
		}
		return count;
	}

}
