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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;


public class DancingWithTheGooglers {
	public static void main(String[] args) {
		 try {
	            // t@CIuWFNgð¶¬·é
	            FileInputStream fileInputStream =
	                new FileInputStream("B-small-attempt0.in");
	            InputStreamReader inputStreamReader =
	                new InputStreamReader(fileInputStream);
	            BufferedReader bufferedReader =
	                new BufferedReader(inputStreamReader);
	            // t@C©çêsÇÝæé
	            String lines = bufferedReader.readLine();
	            int len = Integer.parseInt(lines);
	            String[] str = new String[len];
	            for(int i = 0; i < len; i++){
	            	str[i] = bufferedReader.readLine();
	            }

	            // t@CIuWFNgðjü·é
	            bufferedReader.close();
	            inputStreamReader.close();
	            fileInputStream.close();


	            FileOutputStream fileOutputStream =
	                new FileOutputStream("answerDWG.txt");
	            OutputStreamWriter outputStreamWriter =
	                new OutputStreamWriter(fileOutputStream);
	            BufferedWriter bufferedWriter =
	                new BufferedWriter(outputStreamWriter);
	            //\bhú»
	            DancingWithTheGooglers dwg = new DancingWithTheGooglers();
	            for(int i = 0; i < len; i++){
	            	bufferedWriter.write("Case #" + (i+1) + ": " + dwg.keisan(str[i]) + "\n");
	            	// t@CÉàeð«Þ
	            }
	            // t@CIuWFNgðjü·é
	            bufferedWriter.close();
	            outputStreamWriter.close();
	            fileOutputStream.close();


	        // êAÌt@CÍIOExceptionª­¶·é
	        } catch (IOException ex) {
	            ex.printStackTrace();
	        }
	}
	
	private int keisan(String str){
		String[] inp = str.split(" ",-1);
		int i;
		int N = Integer.parseInt(inp[0])+3;
		int S = Integer.parseInt(inp[1]);
		int p = Integer.parseInt(inp[2]);
		int cnt = 0;
		int s_cnt = 0;
		for(i=3;i<N;i++){
			int ttl = Integer.parseInt(inp[i]);
			int a = ttl/3;
			int b = ttl%3;
			if(a >= p){
				cnt++;
			} else if(a == p-1){
				if(b > 0){
					cnt++;
				} else {
					if(a > 0 && s_cnt < S){
						cnt++;
						s_cnt++;
					}
				}
			} else if(a == p-2){
				if(b == 2 && s_cnt < S){
					cnt++;
					s_cnt++;
				}
			}
		}
		return cnt;	
	}

}
