/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.util.Arrays;
import java.util.Scanner;


public class dancingWithTheGooglers {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int nCases = in.nextInt();
		for (int c = 0; c < nCases; c++) {
			int n = in.nextInt();
			int s = in.nextInt();
			int min = in.nextInt();
			//System.out.printf("%d is the best result we're looking for\n", min);
			int[] t = new int[n];
			for (int i = 0; i < n; i++) {
				t[i] = in.nextInt();
			}
			Arrays.sort(t);
			int unsurprisingMinTotal = min + 2*(min-1 < 0 ? 0 : min-1);
			int surprisingMinTotal = min + 2*(min-2 < 0 ? 0 : min-2);
			int count = 0;
			int surprisesLeft = s;
			while (surprisesLeft >= 0) {
				if (t[t.length-1-count] >= unsurprisingMinTotal) {
					//System.out.printf("%d is unsurprising\n", t[t.length-1-count]);
					count++;
				} else if(t[t.length-1-count] >= surprisingMinTotal && surprisesLeft > 0) {
					//System.out.printf("%d is surprising\n", t[t.length-1-count]);
					surprisesLeft--;
					count++;
				} else {
					//System.out.printf("%d is rejected\n", t[t.length-1-count]);
					surprisesLeft = -1;
				}
				
				if (count >= t.length) {
					break;
				}
			}
			System.out.printf("Case #%d: %d\n", c+1, count);
		}
	}
}
