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

package codejam;

import java.io.*;
import java.util.Arrays;

/**
 * @author Dmitry Korolev
 */
public class Task2 {

    public static void main(String[] args) throws IOException {
        Reader inputReader = /*new InputStreamReader(System.in);*/ new FileReader("B-large.in");
        Writer outputWriter = /*new OutputStreamWriter(System.out);*/ new FileWriter("B-large.out");
        BufferedReader in = new BufferedReader(inputReader);
        BufferedWriter out = new BufferedWriter(outputWriter);
        String tStr = in.readLine();
        int tests = Integer.parseInt(tStr);
        for (int i = 0; i < tests; i++) {
            String line = in.readLine();
            String[] strs = line.split("\\s");
            int[] nums = new int[strs.length];
            for (int j = 0; j < strs.length; j++) {
                nums[j] = Integer.parseInt(strs[j]);
            }
            int s = nums[1];
            int p = nums[2];
            int[] t = Arrays.copyOfRange(nums, 3, nums.length);
            out.write("Case #" + (i + 1) + ": " + solve(0, s, p, t) + "\n");
        }
        in.close();
        out.close();

        assert solve(3, 1, 5, 15, 13, 11) == 3;
        assert solve(3, 0, 8, 23, 22, 21) == 2;
        assert solve(2, 1, 1, 8, 0) == 1;
        assert solve(6, 2, 8, 29, 20, 8, 18, 18, 21) == 3;
    }

    private static int solve(int n, int s, int p, int... t) {
        Arrays.sort(t);
        int surprisingCount = 0;
        int result = 0;
        for (int i = t.length - 1; i >= 0; i--) {
            int total = t[i];
            int score = getMaxScore(total);
            if (surprisingCount < s && canBeSurprising(total)) {
                int surprisingScore = getMaxSurprisingScore(total);
                if (score < p && surprisingScore >= p) {
                    surprisingCount++;
                    score = surprisingScore;
                }
            }
            if (score >= p) {
                result++;
            }
        }
        return result;
    }

    private static boolean canBeSurprising(int total) {
        return (total >= 2) && (total <= 28);
    }

    private static int getMaxScore(int total) {
        return (total + 2) / 3;
    }

    private static int getMaxSurprisingScore(int total) {
        return (total + 4) / 3;
    }
}
