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 code12;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.List;

public class Googlers {

	public static void main(String[] args) {
		
		try {
			BufferedReader fileGoo = new BufferedReader(new FileReader("B-large.in"));
			FileWriter miArchivo = new FileWriter("B-large.out");
			
			List<String> listaCasos = new ArrayList<String>();
			String linea;
			while ((linea = fileGoo.readLine()) != null) {
				listaCasos.add(linea);
			}
			int casos = new Integer(listaCasos.get(0));
			
			listaCasos.remove(0);
			int indc=1;
			
			if (casos>0 && casos<=100){
				for (String cadenas: listaCasos) {
					String [] valores= cadenas.split(" ");
					int n= new Integer (valores[0]);
					int s= new Integer (valores[1]);
					int p= new Integer (valores[2]);
					if(s<0 || s>n)
						continue;
					if(p<0 || p>10)
						continue;
					if(n<1 || n>100)  // SmallData
						continue;
					
					int contador = 0;
					int casoEsp=1;
					for (int i = 3; i < valores.length; i++) {
							Integer p1= p-1<0?0:p-1;
							Integer p2= p-2<0?0:p-2;
							Integer valor =new Integer(valores[i]);
							Integer caso1 = p+ p+ p;
							Integer caso2 = p+ p+ p1;
							Integer caso3 = p+ p1+ p1;
							Integer caso4 = p+ p1+ p2;
							Integer caso5 = p+ p2+ p2;
							Integer caso6 = p+ p+ p2;
							
							if(valor<0 || valor>30)
								continue;
							
							if (caso1<valor ||caso2<valor || caso1.equals(valor) || caso2.equals(valor)|| caso3.equals(valor)){
								contador++;
							}
							else if ((s>0 && casoEsp<=s) &&  (caso4.equals(valor) || caso5.equals(valor)|| caso6.equals(valor))){
								contador++;
								casoEsp++;
							}
					}
					miArchivo.write("Case #" + indc + ": " + contador+"\n");
					indc++;
				}	
			}
			
			
			
			miArchivo.flush();
			miArchivo.close();	
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
}
