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


    }
}

import java.util.Scanner;

public class DancingWithTheGooglers {

   public static void main(String[] argv) {

      int lineCounter,numberOfLines,people,currentScore;
      int surprises,scoreToBeat,counter,answer;
      int possibleScore;
      Scanner input = null;

      try {input = new Scanner(System.in);}
      catch (Exception e) { System.err.println("FileNotFoundException: " + e.getMessage()); }

      numberOfLines = input.nextInt();

      for (lineCounter = 0; lineCounter < numberOfLines; lineCounter++) {
         answer = 0;
         input.nextLine();
         people = input.nextInt();
         surprises = input.nextInt();
         scoreToBeat = input.nextInt();

         for (counter = 0; counter < people; counter++) {
            currentScore = input.nextInt();
            possibleScore = scoreNoSurprise(currentScore);
            if (possibleScore >= scoreToBeat)
               answer++;
            else if (surprises > 0) {
               possibleScore = scoreSurprise(currentScore);
               if (possibleScore >= scoreToBeat) {
                  answer++;
                  surprises--;
               }
            }
         }

         System.out.printf("Case #%d: %d\n",lineCounter+1,answer);

      }

   }

   public static int scoreNoSurprise(int value) {
      if (value < 2)
         return value;
      if (value == 2)
         return 1;
      int totalScore = value;
      int divergence = totalScore%3;
      int baseScore = totalScore/3;
      if (divergence == 2) {
         return baseScore+1;
      }
      else if (divergence == 1) {
         return baseScore+1;
      }
      else { // divergence == 0
         return baseScore;
      }
   }

   public static int scoreSurprise(int value) {
      if (value < 3)
         return value;
      int totalScore = value;
      int divergence = totalScore%3;
      int baseScore = totalScore/3;
      if (divergence == 2) {
         return baseScore+2;
      }
      else if (divergence == 1) {
         return baseScore+1;         
      }
      else { // divergence == 0
         return baseScore+1;
      }
   }

}
