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.Scanner;


public class QualB {
	
	private int googlers, surprising, p, maxnr;
	private int[] totals;
	
	public QualB(String line){
		String[] limitsStr = line.split("\\s"); 
		googlers = Integer.parseInt(limitsStr[0]);
		surprising = Integer.parseInt(limitsStr[1]);
		p = Integer.parseInt(limitsStr[2]);
		totals = new int[googlers];
		for(int i = 3; i < googlers + 3;i++){
			totals[i-3] = Integer.parseInt(limitsStr[i]);
		}
		
		solve();
	}
	
	private void solve() {
		for(int score : totals){
			if(canSolveTotal(score))
				maxnr++;
		}
	}

	private boolean canSolveTotal(int score) {
		if(score < p)
			return false;
		if(canSolveWithNormalScore(score))
			return true;
		if(canSolveWithSurprisingScore(score)){
			surprising--;
			return true;
		}
		return false;
	}

	private boolean canSolveWithNormalScore(int totalscore) {
		for(int score1 = p; score1 <= 10; score1++){
			for(int score2 = score1-1; score2 <= score1+1; score2++){
				for(int score3 = score1-1; score3 <= score1+1; score3++){
					if(score1+score2+score3 != totalscore)
						continue;
					if(score2 >= score1 - 1 && score2 <= score1 + 1 &&
					   score3 >= score1 - 1 && score3 <= score1 + 1 &&
					   score2 >= score3 - 1 && score2 <= score3 + 1){
						return true;
					}
				}
			}
		}
		return false;
	}
	
	private boolean canSolveWithSurprisingScore(int totalscore) {
		if(surprising <= 0)
			return false;
		boolean suprisingScoreFound = false;
		for(int score1 = p; score1 <= 10; score1++){
			for(int score2 = score1-2; score2 <= score1+2; score2++){
				for(int score3 = score1-2; score3 <= score1+2; score3++){
					if(score1+score2+score3 != totalscore)
						continue;
					if(score2 >= score1 - 2 && score2 <= score1 + 2 &&
							   score3 >= score1 - 2 && score3 <= score1 + 2 &&
							   score2 >= score3 - 2 && score2 <= score3 + 2){
						return true;
					}
					
				}
			}
		}
		return false;
	}
	
	

	public String toString(){
		String toReturn =  String.format("Googlers: %1$d \nSuprising: %2$d \np: %3$d \nscores: [",
							googlers,
							surprising,
							p,
							totals);
		for(int score : totals)
			toReturn += "" + score + " ";
		toReturn = toReturn.substring(0, toReturn.length() - 1);
		return toReturn += "]";
	}
	
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int T = Integer.parseInt(scan.nextLine());
		int i = 0;
		while(scan.hasNextLine()){
			String line = scan.nextLine();
			i++;
			QualB sol = new QualB(line);
			System.out.println("Case #" + i + ": " + sol.maxnr);
		}
	}

}
