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 ProblemB {

    private static final int[] bestSurprise = new int[31];
    private static final int[] bestBoring = new int[31];

    private static void seed() {
	Arrays.fill(bestSurprise, -1);
	Arrays.fill(bestBoring, -1);
	for (int i = 0; i <= 10; i++) {
	    for (int j = Math.max(0, i - 2); (j <= i + 2) && (j <= 10); j++) {
		for (int k = Math.max(0, i - 2); (k <= i + 2) && (k <= 10); k++) {
		    if (Math.abs(k - i) > 2 || Math.abs(k - j) > 2 || Math.abs(i - j) > 2) {
			continue;
		    }
		    int total = i + j + k;
		    int max = Math.max(i, Math.max(j, k));
		    if (Math.abs(k - i) == 2 || Math.abs(k - j) == 2 || Math.abs(i - j) == 2) {
			bestSurprise[total] = Math.max(bestSurprise[total], max);
		    } else {
			bestBoring[total] = Math.max(bestBoring[total], max);
		    }
		}
	    }
	}
    }


    public static int solve(int[] scores, int S, int P) {
	int[][] history = new int[scores.length + 1][S + 1];
	for (int[] cases : history) {
	    Arrays.fill(cases, -1);
	}
	return solve(scores, 0, S, P, history);
    }

    private static int solve(int[] scores, int index, int S, int P, int[][] history) {
	if (index >= scores.length) {
	    if (S > 0) {
		return -1;
	    } else {
		return 0;
	    }
	} else if ((S < 0) || (S > scores.length - index)) {
	    return -1;
	} else if (history[index][S] != -1) {
	    return history[index][S];
	}
	int best = -1;
	if (S > 0 && bestSurprise[scores[index]] != -1) {
	    int surpriseAttempt = solve(scores, index + 1, S - 1, P, history);
	    if (surpriseAttempt != -1) {
		best = Math.max(best, surpriseAttempt + (bestSurprise[scores[index]] >= P ? 1 : 0));
	    }
	}
	if (bestBoring[scores[index]] != -1) {
	    int boringAttempt = solve(scores, index + 1, S, P, history);
	    if (boringAttempt != -1) {
		best = Math.max(best, boringAttempt + (bestBoring[scores[index]] >= P ? 1 : 0));
	    }
	}
	history[index][S] = best;
	return best;
    }

    public static void main(String[] args) throws Exception {
	seed();
	Scanner input = new Scanner(System.in);
	int T = Integer.parseInt(input.nextLine().trim());
	for (int i = 0; i < T; i++) {
	    String[] tokens = input.nextLine().split(" ");
	    int N = Integer.parseInt(tokens[0].trim());
	    int S = Integer.parseInt(tokens[1].trim());
	    int P = Integer.parseInt(tokens[2].trim());
	    int[] scores = new int[N];
	    for (int j = 0; j < N; j++) {
		scores[j] = Integer.parseInt(tokens[3 + j].trim());
	    }
	    System.out.println("Case #" + (i+1) + ": " + solve(scores, S, P));
	}
    }
}