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.IOException;


public class DancingGooglers extends FileReaderWriter {

	/*//int[] GOOG = {29, 20, 8, 18, 18, 21};
	int[] GOOG = {23, 22, 21};*/
	
	DancingGooglers(String inPath, String outPath) throws IOException {
		super(inPath, outPath);
		reader();
		
	}
	
	@Override
	public void reader() throws IOException {
		super.writer();
		strLine = br.readLine();
		nTestCases = Integer.valueOf(strLine);
		
		int N, S, p;
		int nthCase = 0;
		
		int googlerCount = 0;
		
		String toWrite = new String();
		
		
		//While LOOP
		while( (strLine = br.readLine()) != null ) {
			googlerCount = 0;
			++nthCase;
			toWrite = toWrite + "Case #" + nthCase + ": ";
			String[] handler = strLine.split(" ");
			
			int[] GOOG = new int[handler.length];
			
			for(int i=0; i<handler.length; ++i) {
				GOOG[i] = Integer.valueOf(handler[i]);
			}
			
			N = GOOG[0];
			S = GOOG[1];
			p = GOOG[2];
			
			for(int i=3; i<GOOG.length; ++i) {
				int base = (int) GOOG[i] / 3;
				
				switch (GOOG[i] % 3) 
				{
					case 0:
					{
						if(base >= p)
							++googlerCount;
						else {
							if(S>0 && base>0 && base+1>=p) {
								++googlerCount;
								--S;
							}
						}
						break;
					}
					
					case 1:
					{
						if(base >= p || base+1 >= p) {
							++googlerCount;
						}
						else {
							if(S > 0 && base + 1 >= p) {
								++googlerCount;
								S--;
							}
						}
						break;
					}
					
					case 2:
					{
						if(base + 1 >= p || base >= p) {
							++googlerCount;
						}
						else {
							if(S > 0 && base + 2 >= p) {
								++googlerCount;
								--S;
							}
						}
						break;
					}
				}				
			}
			toWrite = toWrite + googlerCount + "\n";			
		}
		System.out.println(toWrite);
		bw.write(toWrite);
		bw.close();
	}

}
