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);
        }
    }
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package qualification;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

/**
 *
 * @author anvarik
 */
public class dancers {
    
    public static void main(String[] args) throws FileNotFoundException {
        
        int t,n,s,p,x,i,res,j;
        File input = new File("C:\\Users\\anvarik\\Desktop\\old\\in.txt");
        Scanner sc = new Scanner(input);
        t = sc.nextInt();
        for(i=1;i<=t;i++){
            n = sc.nextInt();
            s = sc.nextInt();
            p = sc.nextInt();
            res=0;
            for(j=0;j<n;j++){
                x = sc.nextInt();
                if(x>=3*p-2)
                    res++;
                else if(s>0&&(x>=3*p-4)&&((x>0)||p==0)){
                    res++;s--;
                }
            }
            System.out.println("Case #" + i + ":"+ " " + res);
        }
    }
    
}
