import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


   import java.io.*;
   import java.util.*;
   public class dancing
   {
      public static void main(String[] args) throws Exception
      {
         BufferedReader reader = new BufferedReader(new FileReader("B-large.in"));
         PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-large.out")));
         int cases = Integer.parseInt(reader.readLine());
         for(int x = 0; x < cases; x++)
         {
            int count = 0;
            String next = reader.readLine();
            StringTokenizer token = new StringTokenizer(next);
            int N = Integer.parseInt(token.nextToken()); 
            int S = Integer.parseInt(token.nextToken());
            int p = Integer.parseInt(token.nextToken());
            int[] array = new int[N];
            for(int y = 0; y < N; y++)
               array[y] = Integer.parseInt(token.nextToken());
            for(int y = 0; y < N; y++)
            {
               if(array[y] == 0 && p != 0){
               }
               else if(array[y] >= 28)
               {
                  if(p <= 10)
                     count++;
               }
               else if(array[y]%3 == 1)
               {
                  if(array[y]/3 + 1 >= p)
                     count++;
               }
               else if(array[y]%3 == 2)
               {
                  if(array[y]/3 + 1 >= p)
                     count++;
                  else if(array[y]/3 + 2 >= p)
                     if(S > 0)
                     {
                        S--;
                        count++;
                     }
               }
               else if(array[y]%3 == 0)
                  if(array[y]/3 >= p)
                     count++;
                  else if(array[y]/3 + 1 >= p)
                     if(S > 0)
                     {
                        S--;
                        count++;
                     }
            }
            out.println("Case #" + (x + 1) + ": " + count);
         }
         out.close();
      }
   }