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


public class dance {
	public static void main(String... args){
		Scanner in = new Scanner(System.in);
		
		int cases = in.nextInt();
		int[] counts = new int[cases];
		for(int i = 0;i<cases;i++){
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int sUsed = 0; // special cases used
			
			int[] nums = new int[n];
			int[][] scores = new int[n][3];
			for(int k=0;k<n;k++){
				nums[k] = in.nextInt();
				int mod = nums[k] % 3;
				int div = nums[k] /3;
				if (mod == 2 && sUsed < s && div + 2 == p){
					scores[k][0] = div + 2;
					scores[k][1] = div;
					scores[k][2] = div;
					sUsed +=1;
				} else if(mod == 0 && div + 1 == p && sUsed <s && div > 0){
					scores[k][0] = div+ 1;
					scores[k][1] = div;
					scores[k][2] = div-1;
					sUsed += 1;
				}else if (mod == 2){
					scores[k][0] = div + 1;
					scores[k][1] = div + 1;
					scores[k][2] = div;
				} else {
					scores[k][0] = div + mod;
					scores[k][1] = div;
					scores[k][2] = div;
				}
			}
			//count 
			int count = 0;
			for(int k = 0;k<n;k++){
				if(scores[k][0] >= p){
					count++;
				}
			}
			counts[i] = count;
			
		}
		for(int i = 0;i<cases;i++){
			System.out.printf("Case #%d: %d\n",i+1,counts[i]);
		}
		
	}
}
