import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.util.Scanner;


public class C {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int no = sc.nextInt();

    for (int s = 1; s <= no; s++) {
      int players = sc.nextInt();
      int stars = sc.nextInt();
      int best = sc.nextInt();

      int count = 0;

      int k;
      for (int i = 0; i < players; i++) {
        int j = sc.nextInt();
        k = (int) Math.floor(j / 3);
        if (k >= best) {
          count++;
        } else if (k < best) {
          int diff = j - (k * 3);
          if (diff == 1 && (diff + k) == best) {
            count++;
            continue;
          } else if (diff == 2) {
            if ((k + 1) == best) {
              count++;
              continue;
            } else if (stars > 0 && (k + diff) == best) {
              count++;
              stars--;
              continue;
            }
          } else if (diff == 0) {
            int first = k - 1;
            int second = k;
            int third = k + 1;
            if ((stars > 0) && (third == best) && first > 0) {
              stars--;
              count++;
              continue;
            }
          }
        }


      }
      System.out.println("Case #" + s + ": " + count);

    }
  }
}
