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.io.*;
import java.util.*;

public class Main implements Runnable {
  BufferedReader br;
  StringTokenizer st;
  int n, s, p, ans;
  int[] t;
  
  public class Googler implements Comparable<Googler> {
    int total, a, b, c;
    
    public Googler(int total) {
      this.total = total;
      a = total / 3;
      b = (total - total / 3) / 2;
      c = total - a - b;
    }
    
    public int compareTo(Googler g) {
      return g.total - this.total;
    }
  }
  
  public void run() {
    try {
      br = new BufferedReader(new InputStreamReader(System.in));
      int caseNo = Integer.parseInt(br.readLine());
      
      for (int i = 1; i <= caseNo; i++) {
        st = new StringTokenizer(br.readLine());
        n = Integer.parseInt(st.nextToken());
        s = Integer.parseInt(st.nextToken());
        p = Integer.parseInt(st.nextToken());
        t = new int[n];
        Googler[] googler = new Googler[n];
        for (int j = 0; j < n; j++) {
          t[j] = Integer.parseInt(st.nextToken());
          googler[j] = new Googler(t[j]);
        }
        
        Arrays.sort(googler);
        ans = 0;
        for (int j = 0; j < n; j++)
          if (googler[j].c >= p)
            ans++;
        
        for (int j = 0; j < n && s > 0; j++)
          if (googler[j].total > 0 && googler[j].c < p && !((googler[j].a == googler[j].b) && (googler[j].b < googler[j].c))) {
            googler[j].b--;
            googler[j].c++;
            if (googler[j].c == p) {
              ans++;
              s--;
            }
          }
        
        System.out.println("Case #" + i + ": " + ans);
      }
    }
    catch (Exception e) {
    }
  }
  
  public static void main(String[] args) {
    new Thread(new Main()).start();
  }
}
