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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;
/**
 * @author alei
 */
public class B {
    public static void main(String[]Args) throws FileNotFoundException{
        Scanner sn = new Scanner(new FileInputStream("B.in"));
        System.setOut(new PrintStream("B.out"));
        int nCases = sn.nextInt();        
        for(int i=0;i<nCases;i++){
            sn.nextLine();
            int N = sn.nextInt();
            int S = sn.nextInt();
            int P = sn.nextInt();
            int[]totalPoints = new int[N];
            for(int j=0;j<N;j++){
                totalPoints[j] = sn.nextInt();                
            }
            int result = solve(totalPoints,S,P);
            System.out.println("Case #"+(i+1)+": "+result);
        }
                
    }
    public static int solve(int[]totalPoints,int S,int P){
        int m = 0;
        int min = 3*P-4;
        min = min<0?P:min+0;        //the right
        //min = min<0?0:min+0;
        int max = 3*P+4;
        //System.out.println("["+min+";"+max+"]");
                
        int c=0,a=0,ssp=0,sns=0;
        int gigants = 0;
        
        int s1 = 3*P-4;
        int s2 = 3*P-3;
        int s3 = 3*P+3;
        int s4 = 3*P+4;
        for(int i=0;i<totalPoints.length;i++){
            int point = totalPoints[i];
            if(point<=max && point>=min){
                m++;
                if(point==s1 || point==s2||point==s3||point==s4){
                    int n1 = (point+2)/3;
                    if(n1>=P){
                        //System.out.println("sns++->"+point);
                        sns++;
                    }
                    c++;
                }
                else{
                    int n1 = (point+2)/3;
                    if(n1>=P){
                        ssp++;
                    }
                }
            }
            else if(point >max){
                gigants++;
                m++;
            }
            else{
                a++;
            }
        }
        //System.out.println("m->"+m+"->gig->"+gigants+"->a->"+a+"->S->"+S+"->c->"+c+"<->nsp->"+ssp);
                
        if(S>c){
            S-=c;
            if(S>0){
                S-=gigants;
                if(S>0){
                   S-=a;
                   if(S>0){
//                       System.out.println("finalSubst->"+m+"-s:"+S);
                       int reaNsp = Math.min(S, ssp);
                       m = m-S+reaNsp;
                   }
                }
            }            
        }
        else{            
            //sns = Math.min(S, sns);
            int fns = c-S;
            //System.out.println("fns->"+fns+"<->sns->"+sns);
            if(sns>=fns){
                
            }
            else{
                m = m - fns + sns;
            }
        }
        
        return m;
    }
}
