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

import java.io.*;
import java.util.*;

public class dance {

    public static void main(String[] args) throws IOException {
        String filename="sample.txt";
        
        
        
        FileInputStream fstream = new FileInputStream(filename);
        DataInputStream in = new DataInputStream(fstream);

       FileWriter fstreamout = new FileWriter("out.txt");
       BufferedWriter out = new BufferedWriter(fstreamout);

       int n= Integer.parseInt(in.readLine());
      // System.out.println(n);
       for(int i=0;i<n;i++){
       
	   String test = in.readLine();
       String [] temp = test.split(" ");
	   int [] array = new int[temp.length-3];
       int num = Integer.parseInt(temp[0]);
       int sur = Integer.parseInt(temp[1]);
       int p = Integer.parseInt(temp[2]);
	   int count =0;
       //System.out.println(num+" "+sur+" "+p);
       for(int j=0;j<temp.length-3;j++){
       array[j]=Integer.parseInt(temp[3+j]);
       //System.out.println(array[j]);
	   }
      //Arrays.sort(array);

		for(int j=num-1;j>=0;j--){
		
			if(array[j]%3 == 0){
			
                if(array[j]/3 >= p) 
				count++;
				
                else if((array[j]+3)/3 >= p && sur>=1 && array[j]>=3)
				{ count++; sur--;}
				
				else ;
			}

           else if(array[j]%3 == 1)
           {
            if(((array[j]+2)/3) >= p && array[j]>=1) count++;
			else ;            

            }

            else 
           {
            if(((array[j]+1)/3) >= p && array[j]>=2) count++;
            else if(((array[j]+4)/3) >= p && sur>=1 && array[j]>=2) {count++; sur--;}
			else ;
            
            }

       }
       //kmkn
       out.write("Case #"+(i+1)+": "+count+"\n");
       }
		in.close();
       out.close();


       }
    }

