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


public class B {

	static Scanner reader;
	static BufferedWriter writer;	

	static int countS;
	static int S;
	static int P;
	static int N;
	static int result;

	public static void verifiyTriple(int pi) {
		int div = pi/3;
		int mod = pi%3;
		int dif = P - pi/3;

		if (div >= P) {
			result++;
		} else if (dif <= 2){
			if (mod == 0) {
				if (countS < S && dif == 1) {
					countS++;
					result++;
				}
			}
		} else {
			if (dif==1) {
				result++;
			} else if ( mod == 2 && countS < S ) {
				countS++;
				result++;
			}
		}
	}


	public static void main(String[] args) throws IOException {
		reader = new Scanner(new FileReader("in.txt"));
		writer = new BufferedWriter(new FileWriter("out.txt"));

		int nt = reader.nextInt();
		for(int i = 1; i <= nt; i++) {
			result = 0;
			N = reader.nextInt();
			S = reader.nextInt();
			P = reader.nextInt();
			countS = 0;
			for (int j = 0; j < N; j++) {
				int pi = reader.nextInt();
				int div = pi/3;
				int mod = pi%3;
				int dif = P - div;

				if (pi < P)
					continue;

				if (div >= P) {
					result++;
				} else if (dif <= 2){
					if (mod == 0) {
						if (countS < S && dif == 1) {
							countS++;
							result++;
						}
					} else {
						if (dif==1) {
							result++;
						} else if ( mod == 2 && countS < S ) {
							countS++;
							result++;
						}
					}

				}
			}

			writer.write("Case #" + i + ": " + result);
			if (i < nt)
				writer.newLine();
		}
		writer.close();
	}

}
