/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

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

  }
}
