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 ? " *" : ""));
//    }
    
}

public class Scores implements Comparable<Scores>{
    private int first;
    private int second;
    private int third;

    public Scores(int total) {
        first = second = third = total / 3;

        if( (total % 3) == 1 ) {
            first += 1;
        }
        else if( (total % 3) == 2 ) {
            first += 1;
            second += 1;
        }
    }

    public Scores(int first, int second, int third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }

    public int compareTo(Scores otherScores) {
        return this.getTotal() - otherScores.getTotal();
    }

    public int getHighest() {
        if(first >= second && first >= third)
            return first;
        else if(second >= first && second >= third)
            return second;
        else
            return third;
    }

    public int getScore(int position) {
        switch(position) {
            case 1:
                return first;
            case 2:
                return second;
            case 3:
                return third;
            default:
                return -1;
        }
    }

    public int getTotal() {
        return first + second + third;
    }

    public void minMax(int positionToGain, int positionToLose) {
        if( positionToGain == 1 ) {
            if( positionToLose == 2 ) {
                first += 1;
                second -= 1;
            }
            else if( positionToLose == 3 ) {
                first += 1;
                third -= 1;
            }
        }
        else if( positionToGain == 2 ) {
            if( positionToLose == 1 ) {
                second += 1;
                first -= 1;
            }
            else if( positionToLose == 3 ) {
                second += 1;
                third -= 1;
            }
        }
        else if( positionToGain == 3 ) {
            if( positionToLose == 1 ) {
                third += 1;
                first -= 1;
            }
            else if( positionToLose == 2 ) {
                third += 1;
                second -= 1;
            }
        }
    }

    public void skew() {
        if( getTotal() <= 2 )
            return;

        if( (getTotal() % 3) == 0 ) {   // All equal
            minMax(1, 2);
        }
        else if( (getTotal() % 3) == 1 ) {  // 2 Small
            minMax(2, 3);
        }
        else if( (getTotal() % 3) == 2 ) {  // 2 Big
            minMax(1, 2);
        }
    }
}
