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 ? " *" : ""));
//    }
    
}

package codejam;

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Dancing {
    Scanner in;
    PrintWriter out;
    int N;
    int P, S;

    public void solve() throws IOException {
        int tn = in.nextInt();
        in.nextLine();
        for (int test = 1; test <= tn; test++) {
            String line = in.nextLine();
            String[] numbers = line.split(" ");
            N = Integer.parseInt(numbers[0]);
            S = Integer.parseInt(numbers[1]);
            P = Integer.parseInt(numbers[2]);
            int[] x = new int[N];
            for (int i = 0; i < N; i++) {
                x[i] = Integer.parseInt(numbers[3 + i]);
            }
            out.println("Case #" + test + ": " + calculate(x));
        }
    }

    boolean[] moreThanP = new boolean[N];
    boolean[] isSurprising = new boolean[N];
    boolean[] isSurprisingAndMoreThanP = new boolean[N];
    boolean[] seen = new boolean[N];

    private int calculate(int[] x) {
        moreThanP = new boolean[N];
        isSurprising = new boolean[N];
        isSurprisingAndMoreThanP = new boolean[N];
        seen = new boolean[N];
        int res = 0;
        Arrays.sort(x);
        //ArrayUtils.reverse(x);
        for (int i = 0; i < x.length; i++) {
            generate(x, i);
        }

        int i = 0;
        int s = S;
        while (i < N && s > 0) {
            if (isSurprisingAndMoreThanP[i]) {
                s--;
                res++;
                seen[i] = true;
            }
            i++;
        }
        i = 0;
        while (i < N && s > 0) {
           if (!seen[i] && isSurprising[i]) {
               s--;
               seen[i] = true;
           }
            i++;
        }

        i = 0;
        while (i < N) {
            if (!seen[i] && moreThanP[i]) {
                res++;
                seen[i] = true;
            }
            i++;
        }

        return res;
    }

    private void generate(int[] x, int index) {
        for (int a = 10; a >= 0; a--)
            for (int b = 10; b >= 0; b--)
                for (int c = 10; c >= 0; c--) {
                    if (a + b + c == x[index] && isValid(a, b,c)) {
                       if (getMax(a,b,c) >= P) {
                           if (isSurprising(a, b, c)) {
                               isSurprisingAndMoreThanP[index] = true;
                           } else {
                               moreThanP[index] = true;
                           }
                       }
                       else if (isSurprising(a, b, c)) {
                            isSurprising[index] = true;
                       }
                    }
                }
    }


    private boolean isValid(int a, int b, int c) {
        return Math.abs(a - b) <= 2 && Math.abs(b - c) <= 2 && Math.abs(c - a) <= 2;
    }

    private boolean isSurprising(int a, int b, int c) {
        return Math.abs(a - b) == 2 || Math.abs(b - c) == 2 || Math.abs(c - a) == 2;
    }

    private int getMax(int a, int b, int c) {
        return Math.max(Math.max(a, b),c );
    }


    public void run() {
        try {
            in = new Scanner(Googlerese.class.getResourceAsStream("/resources/B-large.in"));
            out = new PrintWriter(new File("/tmp/ProblemB.out"));

            solve();

            in.close();
            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    public static void main(String[] arg) {
        new Dancing().run();
    }


}
