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 Triplet {
	private int total;
	public Triplet(int totalScore){
		total = totalScore;
	}
	
	int getTotal() {
		return total;
	}
	
	boolean isSuprisable() {
		if (total < 2 || total > 28) {
			return false;
		} else {
			return true;
		}
	}
	int getBest(boolean suprising) {
		int extra = total%3;
		int mean = total/3;
		int result = -1;
		
		switch (extra) {
		case 0:
			if (suprising) {
				if (mean >= 1 && mean <= 9) {
					result = (mean+1); // m-1, m, m+1
				} else {
					result = -1;
				}
			} else {
				result = mean; // m, m, m
			}
			break;
		case 1:
			if (suprising) {
				if (mean >= 1 && mean <= 9) {
					result = mean+1; // m-1, m+1, m+1 
				} else {
					result = -1;
				}
			} else {
				result = mean+1; // m, m, m+1
			}
			break;
		case 2:
			if (suprising) {
				if (mean >= 0 && mean <= 8) {
					result = mean + 2; // m, m, m+2
				} else {
					result = -1;
				}
			} else {
				result = mean + 1; // m, m+1, m+1
			}
		default:
			break;
		}
		
		return result;
	}

	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + total;
		return result;
	}
}
