package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

import java.util.*;
import java.lang.*;
import java.io.*;
import static java.lang.System.*;

public class Dancing{
	static int bestScore(int s){
		int[] arr = {10, 10, 10};
		int idx = 0;
		for(int sum = 30; sum!=s; sum--, idx++){
			arr[idx%3]--;
		}
		return arr[2];
	}
	static int bestSurprisingScore(int s){
		int S = s-2;
		int a, b = 0;
		for(a=8; a>=0 ; a--){
			b = S-2*a;
			if(b>=a && b<=(a+2)){
				break;
			}
		}
		if(b<a || b>(a+2)){
			return -1;
		}
		return a+2;
	}
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		int xx = Integer.parseInt(br.readLine());
		for(int yy=0; yy<xx; yy++){
			String[] ss = br.readLine().trim().split("\\s+");
			int n = Integer.parseInt(ss[0]);
			int s = Integer.parseInt(ss[1]);
			int p = Integer.parseInt(ss[2]);
			int[] score = new int[n];
			for(int i=0; i<n; i++){
				score[i] = Integer.parseInt(ss[i+3]);
			}
			ArrayList<Googler> arr = new ArrayList<Googler>();
			for(int i=0; i<n; i++){
				arr.add(new Googler(bestScore(score[i]), bestSurprisingScore(score[i])));
			}
			// out.printf("p = %d\n", p);
			// out.printf("s = %d\n", s);
			// for(Googler g : arr){
				// out.println(g);
			// }
			int nbest = 0, nsbest = 0;
			for(int i=0; i<n; i++){
				if(arr.get(i).best>=p){
					nbest++;
				}else if(arr.get(i).sbest>=p){
					nsbest++;
				}
			}
			if(nsbest<=s){
				out.printf("Case #%d: %d\n", yy+1, nbest+nsbest);
			}else{
				out.printf("Case #%d: %d\n", yy+1, nbest+s);
			}
		}
	}
	static class Googler{
		int best;
		int sbest;
		Googler(int best, int sbest){
			this.best = best;
			this.sbest = sbest;
		}
		public String toString(){
			return String.format("Best: %d SBest: %d", best, sbest);
		}
	}
}