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

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

public class B {

	final boolean DEBUG = false;
	final String PACKAGE = "gcj2012/qual";
	final String PROBLEM = "B";
	
	boolean noSurprise(int x, int p){
		int y = x-p;
		if(y<0)return false;
		if(1<=p){
			if(y==p-1+p-1)return true;
			if(y==p+p-1)return true;
		}
		if(y==p+p)return true;
		if(p+1<=10){
			if(y==p+p+1)return true;
			if(y==p+1+p+1)return true;
		}
		return false;
	}
	boolean surprise(int x, int p){
		int y = x-p;
		if(y<0)return false;
		if(2<=p){
			if(y==p-2+p)return true;
			if(y==p-2+p-2)return true;
			if(y==p-2+p-1)return true;
		}
		if(p+2<=10){
			if(y==p+2+p)return true;
			if(y==p+2+p+1)return true;
			if(y==p+2+p+2)return true;
		}
		return false;
	}
	
	void run(){
		if(!DEBUG){
			try {
//				System.setIn(new FileInputStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-small.in")));
				System.setIn(new FileInputStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-large.in")));
//				System.setOut(new PrintStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-small_out.txt")));
				System.setOut(new PrintStream(new File("./src/"+PACKAGE+"/"+PROBLEM+"-large_out.txt")));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		boolean[][] nosup = new boolean[31][11], sup = new boolean[31][11], ns = new boolean[31][11], s = new boolean[31][11];
		for(int x=0;x<=30;x++)for(int p=0;p<=10;p++){
			nosup[x][p] = noSurprise(x, p); sup[x][p] = surprise(x, p);
		}
		for(int x=0;x<=30;x++)for(int p=0;p<=10;p++){
			boolean f = false;
			for(int k=p;k<=10;k++)f|=nosup[x][k];
			ns[x][p] = f;
			f = false;
			for(int k=p;k<=10;k++)f|=sup[x][k];
			s[x][p] = f;
		}
		for(int CASE=1;CASE<=T;CASE++){
			int N = sc.nextInt(), S = sc.nextInt(), P = sc.nextInt();
			int[] t = new int[N];
			for(int i=0;i<N;i++)t[i]=sc.nextInt();
			boolean[] proc = new boolean[N];
			for(int i=0;i<N&&0<S;i++)if(!ns[t[i]][P]&&s[t[i]][P]){
				S--; proc[i] = true;
			}
			for(int i=0;i<N&&0<S;i++){
				if(proc[i])continue;
				if(s[t[i]][P]){
					proc[i] = true; S--;
				}
			}
			for(int i=0;i<N&&0<S;i++){
				if(proc[i])continue;
				if(s[t[i]][0]){
					proc[i] = true; S--;
				}
			}
			int res = 0;
			for(int i=0;i<N;i++){
				if(proc[i])res+=s[t[i]][P]?1:0;
				else res+=ns[t[i]][P]?1:0;
			}
			System.out.println("Case #"+CASE+": "+res);
		}
	}
	
	public static void main(String[] args) {
		new B().run();
	}
}
