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.*;
import java.util.*;

public class B_Qual {
	static int n, s, score;
	static int inf = 1 << 25;
	static int[][] dp = new int[128][128];
	static int[] points=new int[128];
	public static int go(int index, int surprise) {
		if(surprise>s)return -inf;
		if (index == n) {
			if (surprise == s)
				return 0;
			return -inf;
		}
		if (dp[index][surprise] != -1)
			return dp[index][surprise];
		int res = 0;
		for (int i = 0; i <= 10; i++) {
			for (int j = -1; j <= 1; j++) {
				for (int k = -1; k <= 1; k++) {
					int a = i, b = i + j, c = i + k;
					int max = Math.max(Math.max(a, b), c);
					if (a+b+c==points[index]&&ValidTriple(a,b,c)&&!surp(a,b,c)) {
						if (max >= score)
							res = Math.max(res, 1 + go(index + 1, surprise));
						else
							res = Math.max(res, go(index + 1, surprise));
					}
				}
			}
		}
		for (int i = 0; i <= 10; i++) {
			for (int j = -2; j <= 2; j ++) {
				for (int k = -2; k <= 2; k ++) {
					int a = i, b = i + j, c = i + k;
					int max = Math.max(Math.max(a, b), c);
					if (a+b+c==points[index]&&ValidTriple(a,b,c)&&surp(a,b,c)) {
						if (max >= score)
							res = Math.max(res, 1 + go(index + 1, surprise + 1));
						else
							res = Math.max(res, go(index + 1, surprise + 1));
					}
				}
			}
		}
		return dp[index][surprise] = res;
	}

	private static boolean surp(int a, int b, int c) {
		int[] x={a,b,c};
		for (int i = 0; i < x.length; i++) {
			for (int j = 0; j < x.length; j++) {
				if(x[i]-x[j]==2)return true;
			}
		}
		return false;
	}

	private static boolean ValidTriple(int a, int b, int c) {
		int[] x={a,b,c};
		Arrays.sort(x);
		for (int i = 0; i < x.length; i++) {
			if(!valid(x[i]))
				return false;
		}
		for (int i = 0; i < x.length; i++) {
			for (int j = i+1; j < x.length; j++) {
				if(x[j]-x[i]>2)
					return false;
			}
		}
		return true;
	}

	private static boolean valid(int a) {
		return a >= 0 && a <= 10;
	}

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int tt = 1; tt <= T; tt++) {
			for (int[] x : dp)
				Arrays.fill(x, -1);
			n = in.nextInt();
			s = in.nextInt();
			score = in.nextInt();
			for(int i=0;i<n;i++){
				points[i]=in.nextInt();
			}
			System.out.printf("Case #%d: %d\n", tt, go(0, 0));
		}
	}
}