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.InputStreamReader;
import java.io.IOException;

public class Dance {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int numCases = Integer.parseInt(br.readLine());
		for ( int i = 1; i <= numCases; i++ ) {
			String[] c = br.readLine().split(" ");
			int googlers = Integer.parseInt(c[0]);
			int exceptions = Integer.parseInt(c[1]);
			int target = Integer.parseInt(c[2]);
			int hits = 0;
			int potentials = 0;
			for ( int j = 3; j < (googlers + 3); j++ ) {
				int val = Integer.parseInt(c[j])
					, avg = val/3
					, mod = val%3
					, max = avg + (mod == 2 ? 2 : 1)
					, normalMax = (mod == 0 ? avg : avg + 1)
				;
				//				System.out.println("Checking " + val + " with avg " + avg + " and mod " + mod + " and max " + max + " and normal max " + normalMax);
				if ( (val == 0 && target > 0) || max < target ) {
					continue; // Unobtainable, discard
				}
				else if ( normalMax >= target ) {
					hits++;
				}
				else {
					potentials++;
				}
			}
			System.out.println("Case #" + i + ": " + (hits + (exceptions >= potentials ? potentials : exceptions)));
		}
	}
}