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


public class B {

	public void func(){
		
		Scanner in=null;
		try {
			in = new Scanner(new File("C:\\Users\\Suba\\workspace\\Codejam12\\src\\input.txt"));
		} catch (FileNotFoundException e) {			
			e.printStackTrace();
		}
		int no = in.nextInt();		
		for(int i=0;i<no;++i){
			int ng = in.nextInt();
			int sp = in.nextInt();
			int min = in.nextInt();
			int res = 0;
			int ss = 0;
			int k =3;
			int v = 0;
			int flag = 0;
			int[][] intArr = new int[ng][4]; 
			for(int j=0;j<ng;++j){
				int score = in.nextInt();
				flag = 0;
				v=0;
				k=3;
				while(v<3){
					intArr[j][v] = score/k;
					score -= intArr[j][v];
					if((intArr[j][v] >= min) && flag == 0){
						res++;
						intArr[j][3] = 1;
						++flag;
					}
					--k;
					++v;					
				}
				if(Math.abs((intArr[j][0]-intArr[j][1])) == 2 || Math.abs((intArr[j][1]-intArr[j][2])) == 2 || Math.abs((intArr[j][2]-intArr[j][0])) == 2 ){
					++ss;
				}
			}
			if((res <  ng) && (ss < sp)){
				for(int j=0;j<ng;++j){
					if(intArr[j][3] == 0 && (intArr[j][0]+intArr[j][1]+intArr[j][2] != 0)){
						if(Math.abs(intArr[j][0]-intArr[j][1]) < 1){
							if(j==ng-1){
								intArr[j][0]--;
								intArr[j][1]++;
								if(intArr[j][0] >= min || intArr[j][1]>= min) ++res;
								++ss;
							}else{
								if(intArr[j][0]-1 >= min || intArr[j][1]+1 >= min){
									intArr[j][0]--;
									intArr[j][1]++;
									++res;
									++ss;
								}
							}
							///continue;
						}else if(Math.abs(intArr[j][1]-intArr[j][2]) < 1){
							if(j==ng-1){
								intArr[j][1]--;
								intArr[j][2]++;
								if(intArr[j][1] >= min || intArr[j][2]>= min) ++res;
								++ss;
							}else{
								if(intArr[j][1]-1 >= min || intArr[j][2]+1 >= min){
									intArr[j][1]--;
									intArr[j][2]++;
									++res;
									++ss;
								}
							}
						}else if(Math.abs(intArr[j][2]-intArr[j][0]) < 1){
							if(j==ng-1){
								intArr[j][2]--;
								intArr[j][0]++;
								if(intArr[j][0] >= min || intArr[j][2]>=min) ++res;
								++ss;
							}else{
								if(intArr[j][2]-1 >= min || intArr[j][0]+1 >= min){
									intArr[j][2]--;
									intArr[j][0]++;
									++res;
									++ss;
								}
							}
						}
						if(ss>=sp){
							break;
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+res);
		}
	}
	
	
	public static void main(String[] args) {
		B b = new B();
		b.func();
	}

}
