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.Scanner;

public class DWG
{
	public static int[] SuspA = null;
	public static int[] nonSuspA = null;

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{

		Scanner scnr = new Scanner(System.in);
		int T = scnr.nextInt();
		for (int t = 1; t <= T; t++)
		{

			int N = scnr.nextInt();
			int S = scnr.nextInt();
			int p = scnr.nextInt();

			SuspA = new int[N];
			nonSuspA = new int[N];

			int ans = 0;
			int suspCount = 0;

			for (int n = 0; n < N; n++)
			{
				int x = scnr.nextInt();
				calcCombs(x, p, n);
				 //System.out.printf ( "a (%d) b (%d) \n" , SuspA[n], nonSuspA[n]);

				if (nonSuspA[n] > 0)
				{
					ans++;
				} else
				{
					if (SuspA[n] > 0 && suspCount < S)
					{
						ans++;
						suspCount++;
					}
				}
			}
			System.out.println("Case #" + t + ": " + ans);
			// System.out.printf("Case #%d: %d\n", t, ans);
		}
	}

	private static void calcCombs(int n, int p, int index)
	{
		int sum = n;
		int minP = p;
		int susp = 0;
		int nonSusp = 0;
		for (int i = 0; i <= 10; i++)
		{
			for (int j = 0; j <= 10; j++)
			{
				for (int k = 0; k <= 10; k++)
				{
					if (i + j + k == sum)
					{
						if (i >= minP || j >= minP || k >= minP)
						{
							if (Math.abs(i - j) > 2 || Math.abs(j - k) > 2  || Math.abs(i - k) > 2 )
							{
								continue;
							}
							if (Math.abs(i - j) == 2 || Math.abs(j - k) == 2  || Math.abs(i - k) == 2 )
							{
								if (i == j && j == k)
								{
									susp = susp + 3;
								} else
								{
									susp++;
								}
								//System.out.printf(" susp (%d)(%d)(%d) \n ", i , j, k);
							} else
							{
								if (i == j && j == k)
								{
									nonSusp = nonSusp + 3;
								} else
								{
									nonSusp++;
								}
								nonSusp++;
								//System.out.printf(" nonsusp (%d)(%d)(%d) \n ", i , j, k);
							}
						}
					}
				}
			}
		}
		 //System.out.printf("susp: %d nonsusp: %d", susp/3, nonSusp/3);
		SuspA[index] = susp / 3;
		nonSuspA[index] = nonSusp / 3;
	}

}
