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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class B {
	HashMap<Integer, HashSet<ArrayList<Integer>>> pre = new HashMap<Integer, HashSet<ArrayList<Integer>>>();
	{
		for(int a = 0; a <= 10; a++)
			for(int b = 0; b <= a; b++)
				for(int c = 0; c <= b; c++){
					ArrayList<Integer> tmp = new ArrayList<Integer>();
					tmp.add(a);
					tmp.add(b);
					tmp.add(c);
					Integer sum = a + b + c;
					if(a - c > 2) continue;
					if(pre.get(sum) == null)
						pre .put(sum, new HashSet<ArrayList<Integer>>());
					pre.get(sum).add(tmp);
				}
	}
	/*
	 * 18 = 6 6 6, 5 6 7 
	 * 19 = 5 7 7, 6 6 7 
	 * 20 = 6 7 7 
	 * 21 = 7 7 7, 6 7 8 
	 * 28 = 8 10 10
	 */
	private boolean isSurprize(ArrayList<Integer> a){
		return (a.get(0) - a.get(2)) == 2;
	}
	private boolean canBeSurprize(int a) {
		for(ArrayList<Integer> t: pre.get(a))
			if(isSurprize(t)) return true;
		return false;
	}
	private int getBestScore(int a, boolean surprize){
		int best = -1;
		for(ArrayList<Integer> t: pre.get(a))
		{
			if(surprize != isSurprize(t))
				continue;
			if(best < t.get(0))
				best = t.get(0);
		}
		return best;
	}
	private void printState(int a){
		for(ArrayList<Integer> t: pre.get(a)){
			for(Integer i: t)
				System.out.print(i + " ");
			System.out.print(", ");
		}
		System.out.println();
	}
	private void run() throws FileNotFoundException {
		Scanner sc = new Scanner(new FileInputStream("B-large.in"));
		System.setOut(new PrintStream(new FileOutputStream("b.out")));
		int t = sc.nextInt();
		for (int i = 0; i < t; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int arr[] = new int[n];
			for (int j = 0; j < n; j++) {
				arr[j] = sc.nextInt();
//				printState(arr[j]);
			}
			Arrays.sort(arr);
			int bes[] = new int[n];
			for(int j = n - 1; j >= 0; j--){
				int bestS = getBestScore(arr[j], true);
				int bestNS = getBestScore(arr[j], false);
				if(bestNS >= p){
					bes[j] = bestNS;
					continue;
				}
				if(s > 0 && bestS >= p)
				{
					bes[j] = bestS;
					s--;
					continue;
				}
				
				bes[j] = bestNS;
			}
			int res = 0;
			for(int j = 0; j < bes.length; j++)
				if(bes[j] >= p) res++;

			System.out.println("Case #" + (i + 1) + ": " + res);
		}
	}

	public static void main(String[] args) throws FileNotFoundException {
		B b = new B();
		b.run();
	}
}
