import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.util.Scanner;
import java.io.*;
public class Q2 {
  public static void main(String[] args) throws IOException {
    Scanner w = new Scanner(new File("D:/sample.txt"));
    int cases = Integer.parseInt(w.nextLine());
    for (int i = 0; i < cases; i++) {
      int count = 0;
      int n = w.nextInt();
      int s = w.nextInt();
      int p = w.nextInt();
      for (int j = 0; j < n; j++) {
        int total = w.nextInt();
        int k = total / 3;
        int r = total % 3;
        if (total == 0) {
          if (0 >= p) count++;
        }
        else if(r==0){
          if(k>=p)count++;
          else if(s>0&&k+1>=p){
            s--;
            count++;
          }
        }
        else if(r==1){
          if(k+1>=p)count++;
        }
        else if(r==2){
          if(k+1>=p)count++;
          else if(s>0&&k+2>=p){
            s--;
            count++;
          }
        }
      }
    System.out.println("Case #" + (i + 1) + ": " + count);
    }
  }    
}