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

import java.io.*;

/**
 *
 * @author alexho
 */
public class GDWG {
    
    private static int [] result;
    
    
    private void readInput (String infn) throws FileNotFoundException, IOException {
        String line = null;        
        int testCases = 0;
        BufferedReader bufRdr = null;      
        String delimiter = " ";
        File file = new File(infn);
        bufRdr = new BufferedReader(new FileReader(file));            

        testCases = Integer.valueOf(bufRdr.readLine());        
        GDWG.result = new int [testCases];
        
        int index=0;
                
        while ( (line = bufRdr.readLine()) != null ) {
                        
            String [] temp;            
            temp = line.split(delimiter);            
            this.computeMax(temp, index);            
            index++;

        }
        bufRdr.close();

        
    }
    
    private void output (String outfn) throws IOException {
        PrintWriter out = new PrintWriter(new FileWriter(outfn));
        for (int i=0;i<GDWG.result.length;i++) {
            out.println("Case #"+(i+1)+": "+GDWG.result[i]);

        }
        out.close();        
    }
    
    private void computeMax (String [] tempS, int index) {
        
        int N,S,p, max=0,Nti;
        N = Integer.valueOf(tempS[0]);
        S = Integer.valueOf(tempS[1]);
        p = Integer.valueOf(tempS[2]);
        
        for (int i=3;i<tempS.length;i++) {
            Nti = Integer.valueOf(tempS[i]);
            
            // 1st case
            if (p == 0) {
                max++;
            } else if (p > Nti) {
                // do nothing
            } else if (Nti/3 >= p) {
                max++;                
            } else if (p - Nti/3 <=2 && p - Nti/3 > 0 ) {
                if ( 3*p == Nti) {
                        max++;
                    } else if (3*p+1 == Nti) {
                        max++;
                    } else if (3*p-1 == Nti) {
                        max++;
                    } else if (3*p-2 == Nti) {
                        max++;
                    } else if (3*p+2 == Nti) {
                        max++;
                    } else if (3*p-3 == Nti && S > 0) {
                        S--;
                        max++;
                    } else if (3*p+3 == Nti && S > 0) {
                        S--;
                        max++;
                    } else if (3*p-4 == Nti && S > 0) {
                        S--;
                        max++;
                    } else if (3*p+4 == Nti && S > 0) {
                        S--;
                        max++;
                    }
                
            } else {
                
            }
            
            
                                                                           
        }
        GDWG.result[index]=max;
    }
    
    public GDWG () {
        
    }

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        
        String infn = args[0];
        String outfn = args[1];
        GDWG gdwg = new GDWG();
        gdwg.readInput(infn);
        gdwg.output(outfn);
        for (int i=0;i<GDWG.result.length;i++) {
            System.out.println(GDWG.result[i]);
        }
        
    }
}
