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.BufferedReader;
import java.io.FileReader;
import java.util.ArrayList;


public class Run2
{
	public static void main(String[] args)
	{
		String path = "files/B-large.in";
		
		int T = 0;
		ArrayList<ArrayList<Integer>> googlers = new ArrayList<ArrayList<Integer>>();
		ArrayList<Integer> surprisings = new ArrayList<Integer>();
		ArrayList<Integer> leasts = new ArrayList<Integer>();
		
		try
		{
			boolean isFirstLine = true;
			
			FileReader FR = new FileReader(path);
			BufferedReader BR = new BufferedReader(FR);
			String str = "";
			
			while((str=BR.readLine())!=null)
			{
				if (isFirstLine)
				{
					T = Integer.parseInt(str);
					isFirstLine = false;
				}
				else
				{
					String[] temp = str.split(" ");
					
					surprisings.add(Integer.parseInt(temp[1]));
					leasts.add(Integer.parseInt(temp[2]));
					
					ArrayList<Integer> score = new ArrayList<Integer>();
					for(int i = 3; i < temp.length; i++)
					{
						score.add(Integer.parseInt(temp[i]));
					}
					googlers.add(score);
				}
			}
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
		
		for(int i = 0; i < T; i++)
		{
			ArrayList<Integer> googler = googlers.get(i);
			int surprising = surprisings.get(i);
			int least = leasts.get(i);
			int number = 0;
			
			int dontSurprising = 0;
			int isSurprising = 0;
			for(int j = 0; j < googler.size(); j++)
			{
				int score = googler.get(j);
				
				int surprisingBounds = least+(least-2)*2;
				int dontSurprisingBounds = least+(least-1)*2;
				if (least < 2)
				{
					surprisingBounds = least;
					dontSurprisingBounds = least;
				}
				if (score >= surprisingBounds && score < dontSurprisingBounds)
				{
					isSurprising++;
				}
				else if (score >= dontSurprisingBounds)
				{
					dontSurprising++;
				}
			}
			number = dontSurprising+isSurprising+((surprising-isSurprising)>=0?0:(surprising-isSurprising));
			System.out.println("Case #"+(i+1)+": "+number);
		}
	}
}