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 exercicio.b;

import java.awt.List;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;

public class ExerciocioB {

	public static void main(String args[]) throws IOException {

		int[][] combinacoes = new int[1331][3];

		for (int i = 0; i <= 10; i++) {
			for (int j = 0; j <= 10; j++) {
				for (int k = 0; k <= 10; k++) {
					combinacoes[i * 121 + j * 11 + k][0] = i;
					combinacoes[i * 121 + j * 11 + k][1] = j;
					combinacoes[i * 121 + j * 11 + k][2] = k;
				}
			}
		}

		File fileInput = new File("src/exercicio/b/input.txt");

		FileReader fileReaderInput = new FileReader(fileInput);

		BufferedReader leitorInput = new BufferedReader(fileReaderInput);

		String numeroLinhas = leitorInput.readLine();
		Integer numero = new Integer(numeroLinhas);

		String linhaInput = null;
		for (int j = 0; j < numero; j++) {
			linhaInput = leitorInput.readLine();
			String[] linha = linhaInput.split(" ");

			Integer numeroGoo = new Integer(linha[0]);
			Integer numeroSurp = new Integer(linha[1]);
			Integer minScore = new Integer(linha[2]);

			int[] pontos = new int[numeroGoo];
			
			for(int b = 0; b< numeroGoo; b++){
				pontos[b] = new Integer(linha[b+3]);
			}

			boolean[] semSurp = new boolean[numeroGoo];
			boolean[] comSurp = new boolean[numeroGoo];
			for (int k = 0; k < numeroGoo; k++) {
				comSurp[k] = false;
				semSurp[k]=false;
				for (int i = 0; i < combinacoes.length; i++) {
					if (Math.abs(combinacoes[i][0] - combinacoes[i][1]) <= 1
							&& Math.abs(combinacoes[i][0] - combinacoes[i][2]) <= 1
							&& Math.abs(combinacoes[i][1] - combinacoes[i][2]) <= 1
							&& (combinacoes[i][0] + combinacoes[i][1] + combinacoes[i][2]) == pontos[k]
							&& (combinacoes[i][0] >= minScore || combinacoes[i][1] >= minScore || combinacoes[i][2] >= minScore)) {
						semSurp[k] = true;
						break;
					}
				}
				
				for (int i = 0; i < combinacoes.length; i++) {
					if (Math.abs(combinacoes[i][0] - combinacoes[i][1]) <= 2
							&& Math.abs(combinacoes[i][0] - combinacoes[i][2]) <= 2
							&& Math.abs(combinacoes[i][1] - combinacoes[i][2]) <= 2
							&& (combinacoes[i][0] + combinacoes[i][1] + combinacoes[i][2]) == pontos[k]
							&& (combinacoes[i][0] >= minScore || combinacoes[i][1] >= minScore || combinacoes[i][2] >= minScore)) {
						comSurp[k] = true;
						break;
					}
				}
			}
			
			int contaMaior = 0;
			for(int a = 0; a < numeroGoo; a++){
				if(semSurp[a] == true)
					contaMaior++;
			}
			for(int a = 0; a < numeroGoo; a++){
				if(comSurp[a] == true && numeroSurp >0 && !semSurp[a]){
					contaMaior++;
					numeroSurp--;
				} else if (numeroSurp == 0){
					break;
				}
			}
			
			System.out.println("Case #" + (j + 1) + ": "+contaMaior);
		}
	}
}
