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 googlers;

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

public class Main {
	
	public static int calcWIS(int n){
		if(n - 2 < 0)
			return 0;
		return ((n - 2) / 3) + 2;
	}
	
	public static int calcWOS(int n){
		if(n - 1 < 0)
			return 0;
		return ((n - 1) / 3) + 1;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		//String fileName = args[0];
		String fileName = "googlers/B-small-attempt0.in";
		Scanner sC = null;
		try {
			sC = new Scanner(new File(fileName));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		int T = sC.nextInt();
		int N, S, p;
		int[] tab, wiS, woS;
		for(int i = 0; i < T; i++){
			N = sC.nextInt();
			S = sC.nextInt();
			p = sC.nextInt();
			tab = new int[N];
			wiS = new int[N];
			woS = new int[N];
			
			for(int j = 0; j < N; j++){
				tab[j] = sC.nextInt();
				wiS[j] = calcWIS(tab[j]);
				woS[j] = calcWOS(tab[j]);
				//System.out.println(tab[j] + " " + wiS[j] + " " + woS[j]);
			}
			
			int count = 0;
			
			for(int j = 0; j < N; j++){
				if(woS[j] >= p){
					count++;
				}
				if(woS[j] < p && wiS[j] >= p && S > 0){
					count++;
					S--;
				}
			}
			
			System.out.println("Case #" + (i + 1) + ": " + count);
			
		}

	}

}
