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.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Scanner;


public class CodejamB {

	public static final String TEST = "test.in", SMALL = "B-small-attempt0.in", LARGE = "B-large.in";
	public static final String OUTPUT = "out.txt";
	
	public static Map<Integer, List<Triplet>> triplets;
	
	public static void main(String[] args) throws Exception
	{
	
		solve(LARGE);
	}
	
	public static void makeAllTriplets()
	{
		triplets = new HashMap<Integer, List<Triplet>>();
		for(int i =0; i <= 10; i++)
		{
			for(int j = 0; j <= 10; j++)
			{
				for(int k = 0; k <= 10; k++)
				{
					Triplet trip = new Triplet(i, j, k);
					if(trip.legal())
					{
						int sum = i + j + k;
						if(!triplets.containsKey(sum))
							triplets.put(sum, new LinkedList<Triplet>());
						triplets.get(sum).add(trip);
					}
				}
			}
		}
	}

	public static void solve(String filename) throws Exception
	{
		makeAllTriplets();
		
		Scanner in = new Scanner(new File(filename));
		
		int cases = in.nextInt();
		in.nextLine();
		
		PrintWriter out = new PrintWriter(new File(OUTPUT));
		
		for(int num = 1; num <= cases; num++)
		{
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int result = 0;
			int[] googlers = new int[N];
			for(int i =0; i < N; i++)
			{
				boolean unsurprised = false;
				boolean valid = false;
				int sum = in.nextInt();
				List<Triplet> poss = triplets.get(sum);
				for(Triplet t: poss)
				{
					if(t.best() >= p && !t.surprising())
					{
						unsurprised = true;
						valid = true;
						System.out.println("UNSURPRISING " + Arrays.toString(t.scores) + "= " + sum);
					}
					else if(t.best() >= p)
					{
						valid = true;
					}
					
				}
				if(!unsurprised && S > 0 && valid)
				{
					S--;
					result++;
				}
				else if(unsurprised)
				{
					result++;
				}
			}
			
			
			in.nextLine();
		
			
			
			out.println("Case #"+num+": "+result);
			System.out.println("Case #"+num+": "+result);
		}
		
		out.close();
	}
	
}

class Triplet
{
	int[] scores;
	
	public Triplet(int a, int b, int c)
	{
		scores = new int[]{a,b,c};
		Arrays.sort(scores);
	}
	
	public int best()
	{
		return scores[2];
	}
	
	public boolean legal()
	{
		return Math.abs(scores[2] - scores[0]) <= 2;
	}
	
	public boolean surprising()
	{
		return Math.abs(scores[2] - scores[0]) == 2;
	}
}
