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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

import static java.lang.Math.abs;
import static java.lang.Math.max;

public class DancingWithGooglers {

    public static void main(String[] args) throws IOException {
        new DancingWithGooglers().solveAll();
    }

    BufferedReader reader;

    int T;

    private void solveAll() throws IOException {
        reader = new BufferedReader(new InputStreamReader(System.in));
        T = Integer.parseInt(reader.readLine());
        for (int i = 0; i < T; i++) {
            solve(i + 1);
        }
    }

    private void solve(int caseNumber) throws IOException {
        String line = reader.readLine();
        String[] strings = line.split(" ");
        int N = Integer.parseInt(strings[0]);
        int S = Integer.parseInt(strings[1]);
        int P = Integer.parseInt(strings[2]);
        int[] scores = new int[N];
        for (int i = 0; i < N; i++) {
            scores[i] = Integer.parseInt(strings[3 + i]);
        }

        Triplet[] bestTriplets = new Triplet[N];
        Triplet[] bestSurprisingTriplets = new Triplet[N];

        for (int i = 0; i < N; i++) {
            //System.out.println("Score: " + scores[i]);
            bestTriplets[i] = findBestTriplet(scores[i]);
            bestSurprisingTriplets[i] = findBestSurprisingTriplet(scores[i]);
            //System.out.println(bestTriplets[i] + " - " + "*" + bestSurprisingTriplets[i]);
        }

        int result = 0;
        for (int i = 0; i < N; i++) {
            if (bestTriplets[i].scores[0] >= P) {
                result++;
            }
        }
        int usedSurprising = 0;
        for (int i = 0; i < N; i++) {
            if (bestSurprisingTriplets[i].scores[0] >= P
                    && bestTriplets[i].scores[0] < P
                    && usedSurprising < S) {
                result++;
                usedSurprising++;
            }
        }

        System.out.println("Case #" + caseNumber + ": " + result);
    }

    private Triplet findBestTriplet(int score) {
        for (int i = 10; i >= 0; i--) {
            for (int j = i; j >= max(i - 1, 0); j--) {
                for (int k = j; k >= max(j - 1, 0); k--) {
                    if (i + j + k == score && i - k <= 1) {
                        return new Triplet(i, j, k);
                    }
                }
            }
        }
        return null;
    }

    private Triplet findBestSurprisingTriplet(int score) {
        for (int i = 10; i >= 0; i--) {
            for (int j = i; j >= max(i - 2, 0); j--) {
                for (int k = j; k >= max(j - 2, 0); k--) {
                    if (i + j + k == score && i - k <= 2) {
                        return new Triplet(i, j, k);
                    }
                }
            }
        }
        return null;
    }

    class Triplet {
        int[] scores;

        public Triplet(int s1, int s2, int s3) {
            scores = new int[] {s1, s2, s3};
        }

        @Override
        public String toString() {
            return scores[0] + " " + scores[1] + " " + scores[2];
        }
    }

}
