/**
 * 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.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;


public class DancingWiththeGooglers {
	
	enum Type{
		A{
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value+1)/3;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value+1)/3+1;
			}
		},
		B{
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value)/3;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value)/3+1;
			}
		},
		C{
		
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value-1)/3+1;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value-1)/3+1;
			}
		},
		ZERO{
			
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return 0;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return 0;
			}
		},
		ONE{
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return 1;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return 1;
			}
		};
		public static Type valueOf(int value){
			switch (value){
			case 0: return Type.ZERO;
			case 1: return Type.ONE;
			default: 
				switch (value%3){
				case 0: return B;
				case 1: return C;
				case 2: return A;
				default: return null;
				}
			}
			
		}
		int value;
		public abstract int getSurpiseHigh(int value);
		public abstract int getNoSurpiseHigh(int value);
	}

	
	public static void main(String args[]) throws FileNotFoundException{
		//System.setOut(new PrintStream(new File("DancingWiththeGooglers.txt")));
		
		Scanner scanner = new Scanner(System.in);
		int testcasenum = Integer.valueOf(scanner.next());
		scanner.nextLine();
		for (int testcase = 0;testcase < testcasenum;testcase++){
			int googlersnum = scanner.nextInt();
			int surpisesnum = scanner.nextInt();
			int atleast = scanner.nextInt();
			//int totals[] = new int[googlersnum];
			int maximum = 0;
			for (int index = 0;index < googlersnum;index++){
				int total = scanner.nextInt();
				Type type = Type.valueOf(total);
				//System.out.println(type);
				//System.out.println(type.getNoSurpiseHigh(total));
				if (type != Type.ZERO && type != Type.ONE && type != Type.C && type.getSurpiseHigh(total) == atleast && surpisesnum > 0){
					maximum++;
					surpisesnum--;
				}else if (type.getNoSurpiseHigh(total) >= atleast){
					maximum++;
				}
			}
			
			System.out.print("Case #");
			System.out.print(testcase+1);
			System.out.print(": ");
			System.out.println(maximum);
		}
	}
}
