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


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		HashMap<Integer,Integer> nonsurprising=new HashMap<Integer, Integer>();
		HashMap<Integer,Integer> surprising=new HashMap<Integer, Integer>();

		for(int i=0;i<=10;i++)
			for(int j=0;j<=10;j++)
				for(int k=0;k<=10;k++)
				{
					if(Math.abs(i-j)>2||(Math.abs(i-k)>2)||(Math.abs(k-j)>2))
					{
						continue;
					}
					else if(Math.abs(i-j)<=2||(Math.abs(i-k)<=2)||(Math.abs(k-j)<=2))
					{
						//suprising
						Integer sum=i+j+k;
						Integer local_Max=Math.max(i, Math.max(j, k));
						if(surprising.containsKey(sum))
						{
							Integer Global_max=surprising.get(sum);
							if(local_Max>Global_max)
							{
								surprising.remove(sum);
								surprising.put(sum, local_Max);
							}
						}
						else
						{
							surprising.put(sum, local_Max);
						}
						if(Math.abs(i-j)<=1&&(Math.abs(i-k)<=1)&&(Math.abs(k-j)<=1))
						{
							//nonsurprising
						
							if(nonsurprising.containsKey(sum))
							{
								Integer Global_max=nonsurprising.get(sum);
								if(local_Max>Global_max)
								{
									nonsurprising.remove(sum);
									nonsurprising.put(sum, local_Max);
								}
							}
							else
							{
								nonsurprising.put(sum, local_Max);
							}
						}
					}
					else
					{
						
					}
				}

		Scanner input=new Scanner(System.in);
		int t=input.nextInt();
		for(int l=1;l<=t;l++)
		{
			int n=input.nextInt();
			int s=input.nextInt();
			int p=input.nextInt();
			
			int[] totalsum=new int[n+1];
			for(int j=1;j<=n;j++)
			{
				totalsum[j]=input.nextInt();
			}
			
			int [][] M=new int [n+1][s+1];
			for(int j=0;j<=s;j++)
				M[0][j]=0;
			for(int i=1;i<=n;i++)
			{
				if(nonsurprising.get(totalsum[i])>=p)
					M[i][0]=M[i-1][0]+1;
				else
					M[i][0]=M[i-1][0];
			}
			for(int i=1;i<=n;i++)
				for(int j=1;j<=s;j++)
				{
					
					int vertical=M[i-1][j]+(nonsurprising.get(totalsum[i])>=p?1:0);
					int diag=M[i-1][j-1]+(surprising.get(totalsum[i])>=p?1:0);
					if(vertical>diag)
						M[i][j]=vertical;
					else
						M[i][j]=diag;
				}
			System.out.println("Case #"+l+": "+M[n][s]);
		}
	}

}
