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

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

public class DancingWithGooglers {
	public static void main (String [] args) throws FileNotFoundException
	{
		Scanner in = new Scanner (new File ("input.txt"));
		int numLines = Integer.parseInt(in.nextLine());
		int caseNum = 1;
		for (int j = 0; j < numLines; j++)
		{	
			System.out.print("Case #" + caseNum + ": ");
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int noSup = 0;
			int sup = 0;
			for (int i = 0; i < n; i++)
			{
				int total = in.nextInt();
				int maxNoSup = maxNoSup(total);
				int maxSup = maxSup(total);
//				System.out.println(total + " " + maxNoSup + " " + maxSup);
				if (maxNoSup >= p)
					noSup++;
				else if (maxSup >= p)
					sup++;
			}
			int temp = s - sup;
			if (temp <= 0)
				System.out.println((noSup + s));
			else
				System.out.println((noSup + (sup)));
			caseNum++;
		}
	}
	private static int maxNoSup(int totalScore)
	{
		int i = totalScore % 3;
		switch (i)
		{
		case 0: return totalScore/3;
		case 1: return totalScore/3 + 1;
		default: return totalScore/3 + 1;
		}
	}
	private static int maxSup(int totalScore)
	{
		if (totalScore == 0)
			return 0;
		int i = totalScore % 3;
		switch (i)
		{
		case 0: return totalScore/3 + 1;
		case 1: return totalScore/3 + 1;
		default: return totalScore/3 + 2;
		}
	}
}
