/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;


public class DancingWithGooglers {
	static class Googler implements Comparable<Googler>{
		int averageScore;
		int remainder;
		
		Googler(int averageScore, int remainder) {
			this.averageScore = averageScore;
			this.remainder = remainder;
		}

		@Override
		public int compareTo(Googler o) {
			return this.averageScore - o.averageScore;
		}
		
	}
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int testCases = Integer.parseInt(br.readLine());
		for (int t = 1; t <= testCases; t++) {
			String[] nspt = br.readLine().split(" ");
			int n = Integer.parseInt(nspt[0]);
			int s = Integer.parseInt(nspt[1]);
			int p = Integer.parseInt(nspt[2]);
			int[] totalPoints = new int[n];
			for (int i = 0, j = 3; i < n; i++, j++) {
				totalPoints[i] = Integer.parseInt(nspt[j]);
			}
			
			Googler[] googlers = new Googler[n];
			for (int i = 0; i < n; i++) {
				googlers[i] = new Googler(totalPoints[i] / 3, totalPoints[i] % 3);
			}
			Arrays.sort(googlers);
			
//			System.out.println("minimum = " + p + ", surprising = " + s);
//			for (int i = 0; i < n; i++) {
//				System.out.println("(" + googlers[i].averageScore + " " + googlers[i].averageScore + " " + googlers[i].averageScore + ") " + googlers[i].remainder);
//			}
			
			int count = 0;
			int i = n - 1;
			for (;i >= 0; i--) {
				if (googlers[i].averageScore >= p) {
					count++;
				} else {
					break;
				}
			}
			
			//average + 1 == p
			for (;i >= 0; i--) {
				if (googlers[i].averageScore + 1 == p) {
					if (googlers[i].remainder == 0 && googlers[i].averageScore != 0 && s > 0) {
						count++;
						s--;
					} else if (googlers[i].remainder >= 1) {
						count++;
					}
				} else {
					break;
				}
			}
			
			//average + 2 == p
			for (;i >= 0;i--) {
				if (googlers[i].averageScore + 2 == p) {
					if (googlers[i].remainder == 2 && s > 0) {
						count++;
						s--;
					}					
				} else {
					break;
				}
			}
			
			System.out.println("Case #" + t + ": " + count);
		}
	}
}
