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.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class BSmall
{

	public static boolean getNDWithThreshold(int hs , int threshold )
	{
		for(int i = 10 ; i >=0 ; i--)
		{
			int remainder = hs - i ;
			if(remainder>0)
			{
			int second = 0 ; 
			int third =0;
			
			if(remainder%2 == 0)
			{
				second = remainder/2 ;
				third = remainder/2 ;
			}
			else
			{
				second = (remainder/2)+1;
				third = (remainder/2) ;
			}
			
			if(i-third <=1)
			{
				if (i>= threshold)
				{
					return true; 
				}
			}
			
		}
		}
		return false ;
	}
	
	public static boolean getSDWithThreshold(int hs , int threshold )
	{
		for(int i = 10 ; i >=0 ; i--)
		{
			int remainder = hs - i ;
			if(remainder>0)
			{
			int second = 0 ; 
			int third =0;
			
			if(remainder%2 == 0)
			{
				second = remainder/2 ;
				third = remainder/2 ;
			}
			else
			{
				second = (remainder/2)+1;
				third = (remainder/2) ;
			}
			
			if(i-third <=2)
			{
				if (i>= threshold)
				{
					return true; 
				}
			}
			}
		}
		return false ;
	}
	
	public static boolean getND(int hs )
	{
		for(int i = 10 ; i >=0 ; i--)
		{
			int remainder = hs - i ;
			int second = 0 ; 
			int third =0;
			
			if(remainder%2 == 0)
			{
				second = remainder/2 ;
				third = remainder/2 ;
			}
			else
			{
				second = (remainder/2)+1;
				third = (remainder/2) ;
			}
			
			if(i-third <=1)
			{
				return true;
			}
			
		}
		return false ;
	}
	
	public static int[] insertionSort(int[] input)
	{
		int [] output = new int[input.length];
		
		for (int i = 0; i < input.length; i++)
		{
		 int j = 0 ;
		 boolean isAdded = false ;
		 while(!isAdded && j<i)
		 {
		 if(input[i]<= output[j])
		 {
			 for (int k = i; k > j; k--)
			{
				output[k]=output[k-1];
			}
			 output[j]=input[i];
			 isAdded = true;
		 }
		 j++;
		 }
		 if(!isAdded)
		 {
			 output[j]=input[i];
		 }
		}
		return output ;
	}
	
	public static void main(String[] args) throws IOException
	{
		Scanner reader = new Scanner(new File("B-large.in"));
		Scanner reader2 = new Scanner(new File("test1.txt"));

		FileWriter writer = new FileWriter(new File("output.out"));
		reader.nextLine();
		int n = 0 ;
		while(reader.hasNext())
		{
			n++;
			String input = reader.nextLine();
//			System.out.println(input);
			String[] inputArray = input.split(" ");
			int size = Integer.parseInt(inputArray[0]);
			int surbCases = Integer.parseInt(inputArray[1]);
			int threshold = Integer.parseInt(inputArray[2]);
			int scores[]  = new int[size];
			int output=0;
			if(threshold!=0)
			{
			for (int i = 3; i < inputArray.length; i++)
			{
			scores[i-3]= Integer.parseInt(inputArray[i]);	
			}
			scores = insertionSort(scores);
			output = 0 ;
			for (int i = 0; i < scores.length; i++)
			{
				if(getNDWithThreshold(scores[i], threshold))
				{
					output++;
				}
				else if(surbCases>0&&getSDWithThreshold(scores[i], threshold))
				{
					output++;
					surbCases -- ;
				}
			}
			}else
			{
				output = size;
			}
			writer.write("Case #"+n+": "+output+"\r\n");
			System.out.println(("Case #"+n+": "+output));
		}
		writer.close();
	}
}
