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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

public class GooglerDancing {

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

		BufferedReader br = new BufferedReader(new FileReader("googlersInput"));
		PrintWriter pw = new PrintWriter(new File("googlersOutput"));
		String T = br.readLine();
		String line;
		int Case = 1;
		while ((line = br.readLine()) != null) {
			String[] strs = line.split(" ");
			int N = Integer.parseInt(strs[0]);
			int surprising = Integer.parseInt(strs[1]);
			int p = Integer.parseInt(strs[2]);
			int[] t = new int[N];
			System.out.println(p + " " + surprising);
			for (int i = 0; i < t.length; i++) {
				t[i] = Integer.parseInt(strs[i + 3]);
			}
			int threshold0 = p + p - 2 + p - 2;
			int threshold1 = p + p - 1 + p - 1;
			if (threshold0 < 0)
				threshold0 = 0;
			if (threshold1 < 0)
				threshold1 = 0;
			int count = 0;
			for (int i = 0; i < t.length; i++) {
				if (t[i] > 0 && t[i] >= threshold0 && t[i] < threshold1) {
					if (surprising > 0) {
						count++;
						surprising--;
						System.out.println(t[i]);

					}
				} else if (t[i] > 0 && t[i] >= threshold1) {
					count++;
					System.out.println(t[i]);
				}
			}
			System.out.println(line + "\nCase #" + Case + ": " + count);
			pw.write("Case #" + Case + ": " + count + "\n");
			Case++;

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

	}

}
