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.io.* ;
import java.util.Scanner;
public class Main2 {
	public static void main(String argsp[]) throws FileNotFoundException{
		
		Scanner in = new Scanner(new FileReader("input.in"));
		PrintWriter out = new PrintWriter("output.txt");
		int T = 0;
		String S1 = in.nextLine() ;
		T = Integer.parseInt(S1);
		for(int i=0;i<T;i++)
		{
			S1 = in.nextLine();
			out.print("Case #"+ (i+1) +": ");
			int space = S1.indexOf(" ");
			int N = Integer.parseInt(S1.substring(0, space));
			S1 = S1.substring(space+1);
			space = S1.indexOf(" ");
			int S = Integer.parseInt(S1.substring(0, space));
			S1 = S1.substring(space+1);
			space = S1.indexOf(" ");
			int p = Integer.parseInt(S1.substring(0, space));
			int a[] = new int[N];
			for(int j=0;j<N-1;j++)
			{
				S1 = S1.substring(space+1);
				space = S1.indexOf(" ");
				a[j] = Integer.parseInt(S1.substring(0, space));
			}
			a[N-1] = Integer.parseInt(S1.substring(space+1));
			int checker = 0;
			if (p>1)
				checker = 3*p - 4;
			else
				checker = 0;
			int great = 0;
			int surprise = 0;
			for(int k=0;k<N;k++)
			{
				if(a[k]>=checker)
					great++;
				if((a[k]==checker || a[k] == checker+1) && p>1)
					surprise++;
				if(p==1 && a[k] == 0)
					great--;
			}
//			System.out.println(great+ " " + surprise);
			int answer = 0;
			if((S-surprise)<=0)
				answer = great+S-surprise;
			else
				answer = great;
			out.println(answer);
		}
		out.close();
	}
}