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.util.Scanner;


class DancingWithGooglers {

    Scanner s = new Scanner(System.in);
	
    public static void main(String args[]) {
	    DancingWithGooglers p = new DancingWithGooglers();
	    p.run();
	}
	
	void run() {
	    prepare();
	    int nCases = s.nextInt();
		for (int i=0; i<nCases; i++) {
			System.out.println("Case #"+(i+1)+": "+runOneCase());
		}
	}
	
	int[][] mTable = new int[31][2];
	
	void prepare() {
	    for (int i=1; i<=28; i++) {
		    mTable[i][0] = (i+2) / 3;
			mTable[i][1] = (i+4) / 3;
		}
		
		mTable[29][0] = 10;
		mTable[29][1] = 10;
		mTable[30][0] = 10;
		mTable[30][1] = 10;
	}
	
	int runOneCase() {
	    int N = s.nextInt();
		int S = s.nextInt();
		int P = s.nextInt();
		
		int count = 0;
		for (int i=0; i<N; i++) {
		    int score = s.nextInt();
			if (mTable[score][0] >= P) {
			    count++;
		    } else if (S>0 && mTable[score][1]>=P) {
			    count++;
				S--;
			}
		}
	    return count;
	}

}