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

public class Googler {
	int total;
	boolean prizeSurprise = false;
	boolean prizeNoSurprise = false;
	boolean failSurprise = false;
	boolean failNoSurprise = false;
	boolean used = false;
	int trueCounter = 0;

	public Googler poss(int total, int prize){
		this.used = false;
		this.total = total;
		for (int i=10; i>-1; i--){
			if (total>=i){
				int twoA = total - (2*i);
				if (twoA >=0 && twoA<= i){
					if (twoA == i || twoA == i-1){
						if (i>=prize){
							if (prizeNoSurprise == false){trueCounter++;}
							prizeNoSurprise = true;
						} else {
							if (failNoSurprise == false){trueCounter++;}
							failNoSurprise = true;
						}
					}
					if (twoA == i-2){
						if (i>=prize){
							if (prizeSurprise == false){trueCounter++;}
							prizeSurprise = true;
						} else {
							if (failSurprise == false){trueCounter++;}
							failSurprise = true;
						}
					}
				}
				int oneA = total - i - (i-1);
				if (oneA >=0 && oneA<= i){
					if (oneA == i ||oneA == i-1){
						if (i>=prize){
							if (prizeNoSurprise == false){trueCounter++;}
							prizeNoSurprise = true;
						} else {
							if (failNoSurprise == false){trueCounter++;}
							failNoSurprise = true;
						}
					}
					if (oneA == i-2){
						if (i>=prize){
							if (prizeSurprise == false){trueCounter++;}
							prizeSurprise = true;
						} else {
							if (failSurprise == false){trueCounter++;}
							failSurprise = true;
						}
					}
				}
				int splitA = total - i - (i-2);
				if (splitA >=0 && oneA<= i){
					if (splitA == i ||oneA == i-1 || splitA== i-2){
						if (i>=prize){
							if (prizeSurprise == false){trueCounter++;}
							prizeSurprise = true;
						} else {
							if (failSurprise == false){trueCounter++;}
							failSurprise = true;
						}
					}
				}
			}
		}
		return this;
	}
	
}
