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

public class Main{
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);

	int T = sc.nextInt();
	int caseNum = 0;

	while(caseNum++<T){

	    int n = sc.nextInt();
	    int s = sc.nextInt();
	    int p = sc.nextInt();
	    int[] t = new int[n];
	    for(int i=0; i<n; i++){
		t[i] = sc.nextInt();
	    }
	    int[][] triplet = new int[n][3];
	    for(int i=0; i<n; i++){
		triplet[i][0] = t[i]/3;
		triplet[i][1] = t[i]/3;
		triplet[i][2] = t[i]/3;
		int tmp = 0;
		for(int j=t[i]%3; j>0; j--){
		    triplet[i][tmp++]++;
		}
	    }

	    int ans = 0;
	    for(int i=0; i<n; i++){
		if(triplet[i][0]>=p && triplet[i][0]!=triplet[i][1]){
		    ans++; triplet[i][0] = -1;
		}
		else if(triplet[i][0]!=triplet[i][1]){
		    triplet[i][0] = -1;
		}
		else if(triplet[i][0]>=p){
		    ans++; triplet[i][0] = -1;
		}
		else if(triplet[i][1]>0){
		    triplet[i][0]++; triplet[i][1]--;
		}
	    }

	    int count = 0;
	    for(int i=0; i<n; i++){
		if(triplet[i][0]>=p){count++;}
	    }
	    if(count>=s){ans += s;}
	    else {ans += count;}

	    System.out.println("Case #"+caseNum+": "+ans);
	}
    }
}
