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;

/**
 *
 * @author Yasura
 */
public class B {

    public static void main(String[] args) {
        Scanner scanInt= new Scanner(System.in);
        int noOfCases = scanInt.nextInt();
        int N,S,p,t,max;
        for(int i=0;i<noOfCases;i++){
            N=scanInt.nextInt();
            S=scanInt.nextInt();
            p=scanInt.nextInt();
            max=0;
            for(int j=0;j<N;j++){
                t=scanInt.nextInt();
                if(t%3==0){
                    if(t/3>p-1){
                        max++;
                    }
                    else if((t/3==p-1)&&S!=0&&t>2){
                        max++;
                        S--;
                    }
                }
                else if(t%3==1 && (t+2)/3>p-1){
                    max++;
                }
                else if (t%3==2){
                    if((t+1)/3>p-1){
                        max++;
                    }
                    else if ((t+1)/3==p-1&&S!=0){
                        max++;
                        S--;
                    }
                }
            }
            System.out.println("Case #"+(i+1)+": "+max);
        }
    }
}
