import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package uk.co.epii.codejam.dancingwiththegooglers;

import uk.co.epii.codejam.common.AbstractProcessor;
import uk.co.epii.codejam.common.Processor;


/**
 *
 * @author jim
 */
public class DancingWithTheGooglersProcessor extends AbstractProcessor {
    
    public int[] getB(int t) {
        switch (t) {
            case 0: return new int[] {0,0};
            case 29: return new int[] {10,10};
            case 30: return new int[] {10,10};
        }
        switch (t % 3) {
            case 0:
                return new int[] {t /3, t / 3 + 1};
            case 1:
                return new int[] {(t + 2) / 3, (t + 2) / 3};
            case 2:
                return new int[] {(t + 1) / 3, (t + 4) / 3};
        }
        throw new IllegalArgumentException("Your t value has defied the "
                + "peano axioms");
    }

    @Override
    public String processLine(String line) {
        DataRow dr = new DataRow(line);
        int mustReach = 0;
        int canOnlyReachWithSurprisingResult = 0;
        for (int t : dr.t) {
            int[] b = getB(t);
            if (b[0] >= dr.p)
                mustReach++;
            else if (b[1] >= dr.p)
                canOnlyReachWithSurprisingResult++;
        }
        int surprisingContribution = Math.min(dr.S, 
                canOnlyReachWithSurprisingResult);
        return (mustReach + surprisingContribution) + "";
    }
    
    
}
