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 google.code.jam;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author Bogatinovi
 */
public class B {
    public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            int T = in.nextInt();
            int br=0;
            for(int i=1;i<=T;i++){
                int Googlers = in.nextInt();
                int suprising = in.nextInt();
                int p = in.nextInt();
                    for(int j=0;j<Googlers;j++){
                        int res=in.nextInt();
                      if(res>=p){
                        if(p*3<=res){++br;}
                        else if((res-p)>=(2*p-2)){
                            br++;
                        }
                        else if(suprising>0){
                            res-=p;
                            if((2*p-4)<=res){
                                br++;
                                suprising--;
                            }
                        }
                      }
                      }
            System.out.println("Case #"+i+": "+br);
            br=0;
            }
    }
}
