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 es.uam.eps.abk.qualification2012;

import java.io.FileInputStream;
import java.io.InputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

/**
 *
 * Dancing With the Googlers
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of scores
 * consists of three integer scores from 0 to 10 inclusive. The judges have very
 * similar standards, so it's surprising if a triplet of scores contains two
 * scores that are 2 apart. No triplet of scores contains scores that are more
 * than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising.
 * (6, 7, 8) and (6, 8, 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum
 * of the three scores in that Googler's triplet of scores.
 * Given the total points for each Googler, as well as the number of surprising
 * triplets of scores, what is the maximum number of Googlers that could have
 * had a best result of at least p?
 *
 * @author Alejandro
 */
public class B {

    private static void solve(InputStream in, PrintStream out) {
        Scanner scan = new Scanner(in);
        int T = scan.nextInt(); // test cases
        for (int t = 1; t <= T; t++) {
            int N = scan.nextInt(); // number of Googlers
            int S = scan.nextInt(); // number of surprising scores
            int p = scan.nextInt(); // best result

            int[] points = new int[N]; // total points
            for (int i = 0; i < N; i++) {
                points[i] = scan.nextInt();
            }

            int n = getGooglers(points, S, p);

            out.println("Case #" + t + ": " + n);
        }
    }

    private static int getGooglers(int[] points, int surprisingScores, int bestResult) {
        int n = 0;
        double[] avg = new double[points.length];
        for (int i = 0; i < points.length; i++) {
            avg[i] = 1.0 * points[i] / 3;
        }
        Arrays.sort(avg);
//        System.out.println(Arrays.toString(avg));
        for (int i = points.length - 1, j = 0; i >= 0 && j < surprisingScores; i--) {
            double m = Math.ceil(avg[i]);
            if ((m > 0.0) && (m < bestResult)) {
                avg[i] += 2.0 / 3;
                j++;
            }
        }
//        System.out.println(Arrays.toString(avg));
        for (int i = 0; i < points.length; i++) {
            double m = Math.ceil(avg[i]);
            if (m >= bestResult) {
                n++;
            }
        }
        for (int i = points.length - 1, j = 0; i >= 0 && j < surprisingScores; i--, j++) {
            avg[i] -= 2.0 / 3;
        }
        return n;
    }

    public static void main(String[] args) throws Exception {
        String file = null;
        file = "inputB2012.txt";

        file = "2012B-small-attempt0.in";

        file = "2012B-large.in";

        InputStream in = new FileInputStream(file);
        PrintStream out = new PrintStream("output." + file);

        solve(in, out);

        in.close();
        out.close();
    }
}
