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.io.*;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;

/**
 * Created by IntelliJ IDEA.
 * User: 875k
 * Date: 4/14/12
 * Time: 12:08 AM
 * To change this template use File | Settings | File Templates.
 */
public class prQB {
    public static boolean notSurprising(int a, int b, int c) {
        return Math.abs(a - b) <= 1 && Math.abs(a - c) <= 1 && Math.abs(b - c) <= 1;
    }
    public static boolean surprising(int a, int b, int c) {
        return !notSurprising(a, b, c) && Math.abs(a - b) <= 2 && Math.abs(a - c) <= 2 && Math.abs(b - c) <= 2;
    }
    public static int[] points;
    public static int[] surpriseMax;
    public static int[] normalMax;
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new FileReader("prQB.in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("prQB.out")));
        points = new int[101];
        surpriseMax = new int[101];
        normalMax = new int[101];
        int T = Integer.parseInt(br.readLine());
        for(int i = 0; i < T; i++) {
            Arrays.fill(points, -1);
            Arrays.fill(surpriseMax, -1);
            Arrays.fill(normalMax, -1);
            StringTokenizer st = new StringTokenizer(br.readLine());
            int N = Integer.parseInt(st.nextToken());
            int S = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());
            for(int j = 0; j < N; j++) {
                points[j] = Integer.parseInt(st.nextToken());
                boolean found = false, founds = false;
                for(int a = Math.min(10, points[j]); a >= 0 && !(found && founds); a--) {
                    for(int b = Math.max(0, points[j] - a); b >= 0; b--) {
                        int c = points[j] - a - b;
                        if(notSurprising(a, b, c) && a >= normalMax[j]) {
                            found = true;
                            normalMax[j] = a;
                        }
                        if(surprising(a, b, c) && a >= surpriseMax[j]) {
                            founds = true;
                            surpriseMax[j] = a;
                        }
                    }
                }
            }
            //for(int j = 0; j < N; j++) { System.out.print(points[j] + "-" + normalMax[j] + "-" + surpriseMax[j] + ", "); } System.out.println();
            HashSet<Integer> hs = new HashSet<Integer>();
            for(int j = 0; j < N && S > 0; j++) {
                if(surpriseMax[j] >= p && normalMax[j] < p) {
                    hs.add(j);
                    S--;
                }
            }
            int c = hs.size();
            for(int j = 0; j < N; j++) {
                if(normalMax[j] >= p && !hs.contains(j)) c++;
            }
            out.println("Case #" + (i + 1) + ": " + c);
        }
        out.close();
        System.exit(0);
    }
}
