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.List;
import java.util.Map;


public class Dwtg {
	List<List<List<String>>> input;
	
	public Dwtg(List<List<List<String>>> input){
		this.input = input;
	}
	
	public void solve(){
		int googlers;
		int surprise;
		int p;
		int res;
		
		int scoreOk;
		int nbOk;
		int potentialSurp;
		int nbSurp;
		for(int i = 0; i < input.size(); i++){
			googlers = Integer.parseInt(input.get(i).get(0).get(0));
			surprise = Integer.parseInt(input.get(i).get(0).get(1));
			p = Integer.parseInt(input.get(i).get(0).get(2));
			res = 0;
			scoreOk = p*3;
			
			nbOk = 0;
			potentialSurp = 0;
			nbSurp = 0;
			if(p == 0){
				System.out.println("Case #" + (i+1) + ": " + googlers);
			}
			else{
				for(int x = 3; x < googlers + 3; x++){
					int score = Integer.parseInt(input.get(i).get(0).get(x));
					if( (score > 0) && (score >= (scoreOk - 2)) ){
						nbOk++;
					}
					else if( (score > 0) && (score >= (scoreOk - 4)) ){
						potentialSurp++;
					}
				}
				nbSurp = Math.min(potentialSurp, surprise);
				res = nbOk + nbSurp;
				System.out.println("Case #" + (i+1) + ": " + res);
			}
		}
	}
}
