import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package leider.ken;

import java.util.Arrays;
import java.util.List;
import java.util.concurrent.Callable;




/**
 *
 * @author ken
 */
class DancingAlgorithm implements Callable<String> {
    private final int caseNumber;
    private final long surprises;
    private final long minScore;
    private final List<Long> totals;

    public DancingAlgorithm(int caseNumber, long surprises, long minScore, List<Long> totals) {
        this.caseNumber = caseNumber;
        this.surprises = surprises;
        this.minScore = minScore;
        this.totals = totals;

    }


    public String call() throws Exception {
        long meetsCount = 0;
        long meetsWithSurpriseCount = 0;
        
        for (Long total : totals) {
            double avgOther = (total - minScore)/ 2.0;
            long min = (long) Math.floor(avgOther);
            if (min < 0) continue;                    
            if (min + 1 >= minScore) {
                meetsCount++;
            } else if (min + 2 >= minScore) {
                meetsWithSurpriseCount++;
            }            
        }
        
        long retval = meetsCount + Math.min(meetsWithSurpriseCount, surprises);
        return String.format("Case #%d: %d", caseNumber, retval);
    }

    @Override
    public String toString() {
        return totals.toString();
    }
    
    
}
