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.FileNotFoundException;
import java.io.FileReader;
import java.util.Iterator;
import java.util.Scanner;

public class DancingWithGooglers {

    public static class Scores {
        public final int S;
        public final int p;
        public final int[] t;

        public Scores(int S, int p, int[] t) {
            this.S = S;
            this.p = p;
            this.t = t;
        }
    }

    public static Iterator<Scores> iterator(Readable input) {
        final Scanner scanner = new Scanner(input);

        return new Iterator<Scores>() {
            private int cases = scanner.nextInt();

            @Override
            public boolean hasNext() {
                return cases > 0;
            }

            @Override
            public Scores next() {
                int N = scanner.nextInt();
                int S = scanner.nextInt();
                int p = scanner.nextInt();

                int[] t = new int[N];
                for (int i = 0; i < N; i++) {
                    t[i] = scanner.nextInt();
                }

                cases--;
                return new Scores(S, p, t);
            }

            @Override
            public void remove() {
                throw new AbstractMethodError();
            }
        };
    }

    public static int maxTuples(Scores scores) {
        int tuples = 0;
        int s = scores.S;

        for (int i : scores.t) {
            int[] tuple = tuplesWithMax(i, scores.p);

            if (tuple.length == 3) {
                if (tuple[0] - tuple[2] == 2 && s > 0) {
                    tuples++;
                    s--;
                } else if (tuple[0] - tuple[2] <= 1) {
                    tuples++;
                }
            }
        }

        return tuples;
    }

    public static int[][] tuples(int total) {
        if (total == 0) {
            return new int[][]{{0, 0, 0}};
        }

        if (total == 30) {
            return new int[][]{{10, 10, 10}};
        }

        int max = total / 3;

        if (total % 3 == 0) {
            return new int[][]{{max, max, max}, {max + 1, max, max - 1}};
        }

        if (total % 3 == 1) {
            return new int[][]{{max + 1, max, max}, {max + 1, max + 1, max - 1}};
        }

        if (max < 9) {
            return new int[][]{{max + 1, max + 1, max}, {max + 2, max, max}};
        }

        return new int[][]{{max + 1, max + 1, max}};
    }


    public static int[] tuplesWithMax(int t, int max) {
        for (int[] tuple : tuples(t)) {
            if (tuple[0] >= max)
                return tuple;
        }
        return new int[]{};
    }

    public static void main(String[] args) throws FileNotFoundException {
        FileReader fileReader = new FileReader(args[0]);

        int caseId = 1;
        Iterator<Scores> iterator = iterator(fileReader);

        while (iterator.hasNext()) {
            int result = maxTuples(iterator.next());
            System.out.format("Case #%s: %s\n", caseId, result);
            caseId++;
        }
    }
}
