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

package qr;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class B {
  public static void main(String[] args) throws FileNotFoundException {
    Scanner scanner = new Scanner(new File("B-small-attempt3.in"));
    int tcn = scanner.nextInt();
    int tc = 1;
    while (tc <= tcn) {
      int n = scanner.nextInt();
      int s = scanner.nextInt();
      int p = scanner.nextInt();
      // int[] base = new int[n];
      int y = 0;

      for (int i = 0; i < n; i++) {
        int t = scanner.nextInt();
        int base = t / 3;
        int mmm = t % 3;
        if (mmm != 0) {
          base++;
        }

        if (base >= p) {
          if (mmm == 0 && t >= 0)
            y++;
          if (mmm == 1 && t >= 1)
            y++;
          if (mmm == 2 && t >= 2)
            y++;
        } else if (s > 0) {
          if (base + 1 == p) {
            if (mmm == 0 && t >= 3) {
              y++;
              s--;
            }
//            if (mmm == 1 && t >= 4) {
//              y+=0;
//              s--;
//            }
            if (mmm == 2 && t >= 2) {
              y++;
              s--;
            }

          }
        }
      }
      System.out.printf("Case #%d: %d\n", tc, y);

      // base >= p -> ok
      // base -1 -> can be ok

      tc++;
    }

  }
}
