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

public class B {	
	
    public static void main(String[] args) throws IOException {

        Scanner in = new Scanner(new File("B-large.in"));
		FileWriter fw = new FileWriter("B-large.out");	
		int T = in.nextInt();
		
		for (int cases = 1; cases <= T; cases++){
			
			// read parameters for this case
			int N = in.nextInt();
			int S = in.nextInt();
			int P = in.nextInt();
			
			// read the data to an array point
			int[] point = new int[N];
			fw.write("Case #" + cases + ": ");
			for (int i = 0; i < N; i++){
				point[i] = in.nextInt();							
			}
			
			// quicksort the array point		
			QuickSort result = new QuickSort(point);
			result.sort();
			
			/* this is used to test
			for (int i = 0; i < N; i++){
				fw.write(" " + point[i]);							
			}
			*/			
			
			// this part is to get the number for this case
			
			int number = N - 1;			
			for (int i = N - 1; i >= 0 && point[i] >= 3 * P - 2; i--){
				number = i - 1;				
			}
			// fw.write("\nP is " + P +" Number is " + number + "      ");
			
			int total = N - 1 - number;
			
			// this part is to inclusice the S
			for (int j = 0; j < S && j <= number && point[number - j] >= 3 * P - 4  && point[number - j] >= 2; j++) {
				total = N - 1 - number + j +1;
			}
			fw.write(total + "\n");
			
		}
		fw.flush();
		fw.close();		
	}
}

// this is the quicksork
class QuickSort {
	private int[] a;
	
	public QuickSort(int[] anArray){
       a = anArray;
    }
   
    public void sort(){
       sort(0, a.length - 1);
    }
 
    public void sort(int low, int high){
		if (low >= high) return;
		int p = partition(low, high);
		sort(low, p);
		sort(p + 1, high);
    }
 
    private int partition(int low, int high){
       // First element
       int pivot = a[low]; 
       int i = low - 1;
       int j = high + 1;
		while (i < j) {
			i++; while (a[i] < pivot) i++;
			j--; while (a[j] > pivot) j--;
			if (i < j) swap(i, j);
		}
		return j;
	}
 
    /**
       Swaps two entries of the array.
       @param i the first position to swap
       @param j the second position to swap
    */
    private void swap(int i, int j){
		int temp = a[i];
		a[i] = a[j];
		a[j] = temp;
	}
}
	