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

package qualitfy;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class Test {
	public static void main (String args[]) throws FileNotFoundException {
		Scanner in = new Scanner(new File ("src//qualitfy/input.in"));
		int T = in.nextInt();
		for (int i = 0; i < T; i++) {
			int N  = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int count = 0;
			int n1=0,n2=0,n3=0;
			for (int j = 0; j < N; j++) {
				int no = in.nextInt();
				int div = no % 3;
				n1 = n2 = n3 = no/3;
				if (div==1)
					n3 = n3 + 1;
				if (div == 2)
					n2 = n3 = n3 + 1;
				
				if (n3 >= p)
					count++;
				else if (S != 0 && no >= 2) {
					if(n2 == n3) {
						n3 = n3 + 1;
						n2 = n2 - 1;
						if (n3 >= p) {
							count++;
							S--;
						}
					}						
				}
			}

			System.out.println("Case #" + (i + 1) + ": " + count);
		}
	}

}