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 cj2012.qual;

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

public class B {
	static boolean[][] NW = new boolean[11][31];
	static boolean[][] SW = new boolean[11][31];
	
	static {
		for (int a = 0; a < 11; a++) {
			for (int b = 0; b < 11; b++) {
				for (int c = 0; c < 11; c++) {
					int max = Math.max(Math.max(a, b), c);
					int min = Math.min(Math.min(a, b), c);
					if (max - min <= 1) NW[max][a+b+c] = true;
					if (max - min == 2) SW[max][a+b+c] = true;
				}
			}
		}
	}
	
	public static void main(String[] args) throws Exception {
		Scanner scan = new Scanner(new File("in/B-large.in"));
		int T = scan.nextInt();
		PrintWriter out = new PrintWriter(new File("out/B-large.txt"));
		for (int z = 1; z <= T; z++) {
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			int[] a = new int[N];
			for (int i = 0; i < N; i++)
				a[i] = scan.nextInt();
			boolean[][] m = new boolean[N][2];
			// False/True: no-win/win
			// 0/1: not-surprising/surprising
			int[] cc = new int[4];
			int alwaysLose = 0;
			int surpriseLose = 1;
			int surpriseWin = 2;
			int alwaysWin = 3;
			for (int i = 0; i < N; i++) {
				for (int j = p; j <= 10; j++) {
					m[i][0] = m[i][0] || NW[j][a[i]];
					m[i][1] = m[i][1] || SW[j][a[i]];
				}
				int k = 0;
				if (m[i][0]) k += 1;
				if (m[i][1]) k += 2;
				cc[k]++;
			}
			int ret = 0;
			while (S > 0 && cc[surpriseWin] > 0) {S--; cc[surpriseWin]--; ret++;}
			while (S > 0 && cc[alwaysLose] > 0) {S--; cc[alwaysLose]--;}
			while (S > 0 && cc[alwaysWin] > 0) {S--; cc[alwaysWin]--; ret++;}
			while (S > 0 && cc[surpriseLose] > 0) {S--; cc[surpriseLose]--;}
			ret += cc[alwaysWin] + cc[surpriseLose];
			out.println("Case #" + z + ": " + ret);
		}
		out.close();
	}
}
