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 ? " *" : ""));
//    }
    
}

/*
 * Program Name :- B.java
 * Author :- Happy Mittal
 * Created on 14 April, 2012
 *
 * 
 */

package googlecodejam11;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.Arrays;

public class B {
    /** Creates a new instance of B */
    public B() {
        try{
            // Open the input file 
            //FileInputStream finstream = new FileInputStream("E:\\B-small-attempt0.in");
             FileInputStream finstream = new FileInputStream("E:\\B-large.in");
            //FileInputStream finstream = new FileInputStream("E:\\test-input.in");
            // Get the object of DataInputStream
            DataInputStream in = new DataInputStream(finstream);
                BufferedReader br = new BufferedReader(new InputStreamReader(in));
                
             // Create a output file 
            //FileWriter foutstream = new FileWriter("E:\\B-small-output.in");
             FileWriter foutstream = new FileWriter("E:\\B-large-output.in");
              //FileWriter foutstream = new FileWriter("E:\\test-output.in");
                BufferedWriter bw = new BufferedWriter(foutstream);
                
            br.readLine(); // read the first line it contains no of cases
            String strLine;
            int caseno = 1;
            //Read File Line By Line
           // strLine = br.readLine();
            while ((strLine = br.readLine()) != null)   {
              // Print the content on the console
             // System.out.println (strLine);
              strLine = strLine.trim();
              int result = NoOFTriplets(strLine); 
              //System.out.println (result);
              String netresult = "Case #" + caseno + ": " + result ;
              bw.write(netresult);
              bw.newLine();
              caseno ++;
            }
            
            
            //Close the input stream
            in.close();
            //Close the output stream
            bw.close();
       
            }catch (Exception e){//Catch exception if any
              System.err.println("Error: " + e.getMessage());
            }
    }
     public static void main(String[] args) {
        // TODO code application logic here
        B b1 = new B();
           }
     public int NoOFTriplets(String str){
            String input[] = str.split(" ");
            int MaxGooglers = 0 ;
            int N = Integer.parseInt(input[0]);
            int S = Integer.parseInt(input[1]);
            int p = Integer.parseInt(input[2]);
           // int value[] = new int[N];
            for(int i=0;i<N;i++)
            {
                int score = Integer.parseInt(input[i+3]);
                if(score <= 1) 
                {
                    if(score >= p) MaxGooglers ++;
                    continue;
                }
                int div = score   / 3 ;
                int rem =  score % 3;
                //System.out.println ("Values  " + div + " --   " + rem);
                if(rem != 0 ) div ++;
                if (div >= p)
                {
                    MaxGooglers ++;
                    // System.out.println ("Hello1");
                }
                else if(S > 0 && rem != 1 && div + 1 >= p )
                {
                    // System.out.println (S + "Hello2");    
                    MaxGooglers ++;
                        S--;
                }
            }
            
           return MaxGooglers;
     }
}
