import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.*;

public class Main
{
    public static void main(String[] args)
            throws Exception
    {
        BufferedReader in = new BufferedReader(new FileReader(args[0]));
        FileWriter out = new FileWriter(args[1]);
        int T = Integer.parseInt(in.readLine());

        for (int t = 1; t <= T; t++)
        {
            String data[] = in.readLine().split("\\ ");
            int N = Integer.parseInt(data[0]);
            int S = Integer.parseInt(data[1]);
            int p = Integer.parseInt(data[2]);
            int[] totalPoints = new int[N];
            for (int i = 0; i < N; i++)
                totalPoints[i] = Integer.parseInt(data[i + 3]);

            int unconditionalSucc = 0;
            int failed = 0;

            int upperLimit;
            int lowerLimit;

            if (p >= 2)
            {
                upperLimit = 3 * p - 3;
                lowerLimit = 3 * p - 4;
            }
            else if (p == 1)
            {
                upperLimit = 0;
                lowerLimit = 1;
            }
            else
            {
                upperLimit = -1;
                lowerLimit = -1;
            }

            for (int i = 0; i < totalPoints.length; i++)
            {
                if (totalPoints[i] > upperLimit)
                    unconditionalSucc++;
                else if (totalPoints[i] < lowerLimit)
                    failed++;
            }

            int uncertain = N - failed - unconditionalSucc;

            out.write("Case #" + t + ": " + (Math.min(uncertain, S) + unconditionalSucc) + "\n");
        }

        in.close();
        out.close();
    }
}
