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.*;
public class ProblemB {
    public static void main(String... args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for (int t=1; t<=T; t++) {
            String ans="";
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();
            List<Integer> list = new ArrayList<>();
            int higher = 0;
            int border = 0;
            for (int n=0; n<N; n++) {
                int point = sc.nextInt();
                int ave   = (int)(Math.ceil(point/3.0));
                if ( ave >= p) higher++;
                else if (p-1 != 0 && ave == p-1 && point%3 != 1) border++;
            }
            if(border >= S){
              System.out.println("Case #" +t+ ": " +(higher+S));
            } else {
              System.out.println("Case #" +t+ ": " +(higher+border));
            }
        }
    }
}
