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


public class B
{
	public static void main(String args[]) throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(br.readLine());
		String[] line;
		int N,S,p;
		int[][] tuple = new int[1000][3];
		int[][] stuple = new int[1000][3];
		int count = 0;
		int scount = 0;

		for(int i=10;i>=0;i--)
		{
			for(int j=i-2;j<=i+2;j++)
			{
				if(j<0 || j>10) continue;
				for(int k=i-2;k<=i+2;k++)
				{
					if(k<0 || k>10) continue;
					if(j-k >2 || k-j > 2)
						continue;
					int a = (i-j > 0) ? i-j : j-i;
					int b = (i-k > 0) ? i-k : k-i;
					int c = (k-j > 0) ? k-j : j-k;

					if(a==2 || b==2 || c==2)
					{
						stuple[scount][0] = i;
						stuple[scount][1] = j;
						stuple[scount++][2] = k;
						continue;
					}
					tuple[count][0] = i;
					tuple[count][1] = j;
					tuple[count++][2] = k;
				}
			}
		}
			

		for(int i=1;i<=T;i++)
		{
			line = br.readLine().split("\\W+");
			N = Integer.parseInt(line[0]);
			S = Integer.parseInt(line[1]);
			p = Integer.parseInt(line[2]);
			int[] score = new int[N];

			for(int j=0;j<N;j++)
				score[j] = Integer.parseInt(line[3+j]);

			int ret = 0;
			for(int j=0;j<N;j++)
			{
				boolean found = false;

				for(int k=0;k<count;k++)
				{
					if((tuple[k][0] + tuple[k][1] + tuple[k][2]) == score[j])
					{
						if(tuple[k][0] >= p || tuple[k][1] >= p || tuple[k][2] >= p)
						{
							found = true;
							ret++;
							break;
						}
					}
				}
				if(!found && S!=0)
				{
					for(int k=0;k<scount;k++)
					{
						if((stuple[k][0] + stuple[k][1] + stuple[k][2]) == score[j])
						{
							if(stuple[k][0] >= p || stuple[k][1] >= p || stuple[k][2] >= p)
							{
								found = true;
								S--;
								ret++;
								break;
							}
						}
					}
				}
			}

			System.out.println("Case #"+i+": "+ret);
		}
	}
}
