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

public class DancingWithGooglers {

	public static void main(String[] args) {

		try {

			BufferedReader br = new BufferedReader(new FileReader("input.txt"));
			BufferedWriter bw = new BufferedWriter(new FileWriter("output.txt"));

			int K, N, S, p, i, j;

			K = Integer.parseInt(br.readLine());
			for (i = 0; i < K; i++) {

				String[] line = br.readLine().split(" ");
				N = Integer.parseInt(line[0]);
				S = Integer.parseInt(line[1]);
				p = Integer.parseInt(line[2]);

				int[] data = new int[line.length - 3];
				for (j = 0; j < data.length; j++) {
					data[j] = Integer.parseInt(line[j + 3]);
					// System.out.print(data[j] + " ");
				}
				// System.out.println();

				int counter = 0;
				for (j = 0; j < data.length; j++) {

					int a, b, c;

					int res;
					a = (int) Math.floor((double) data[j] / 3);
					res = data[j] - a;
					b = (int) Math.floor((double) res / 2);
					res = res - b;
					c = res;

					if (a >= p || b >= p || c >= p) {
						counter++;
					} else if ((a + b + c) != 0 && (a + b + c) != 1) {
						int temp = (p - a) + (p - b) + (p - c);

						if (temp == 3 && S > 0) {

							counter++;
							S--;
						} else if (temp == 4 && S > 0) {
							counter++;
							S--;

						}
					}

				}
				bw.write("Case #" + (i+1) + ": " + counter);
				bw.newLine();

			}
			br.close();
			bw.close();

		} catch (IOException io) {
		}

	}

}
