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.util.Scanner;

/**
 *
 * @author krishna
 */
public class Dance {
    
    public static void main(String [] args)
    {
        Program();
    }
    public static void Program()
    {
        Scanner inp=new Scanner(System.in);
        String patt[];
        int count;
        String line;
       // System.out.println("Test Case ");
                
        int test=Integer.parseInt(inp.nextLine());
        int num=1;
        int S,N,P;
        int judge1,judge2,judge3,rem;
        int Score[]=new int[100];
        while(num<=test)
        {
           // System.out.println("pattern ");
            
            line=inp.nextLine();
            patt=line.split(" ");
            
                N=Integer.parseInt(patt[0]);
                S=Integer.parseInt(patt[1]);
                P=Integer.parseInt(patt[2]);
                count=0;
                for(int i=0;i<N;i++)
                {
                    Score[i]=Integer.parseInt(patt[i+3]);
                    judge1=judge2=judge3=Score[i]/3;
                    rem=Score[i]%3;
                    if(Score[i]==0 )
                    {
                        if(P==0)
                           count++;
                        
                      // System.out.println(judge1+" "+judge2+" "+ judge3);
                    }
                    else if( rem==0  )
                    {
                       if(judge1 >= P)
                           count++;
                       else if( S > 0 && (judge1 + 1)>=P )
                       { 
                           judge1++;
                           judge2--;
                           count++;
                           S--;
                       }
                       // System.out.println(judge1+" "+judge2+" "+ judge3);
                    }
                    else if(rem==1)
                    {
                        judge1++;
                        if(judge1 >= P)
                        {
                           count++;
                        }
                      
                      // System.out.println(judge1+" "+judge2+" "+ judge3);
                        
                    }
                    else if(rem==2)
                    {
                        judge1++;
                        judge2++;
                       if( (judge1 )>=P)
                       {
                           count++;
                       }
                       else if( S!=0  && ((judge1)+1)>=P)
                        {
                           S--;
                           judge1++;
                           judge2--;
                           count++;
                        }
                      
                    //  System.out.println(judge1+" "+judge2+" "+ judge3);
                    }
                } 
                System.out.println("Case #"+num+": "+count);
             num++;
        }
    }
}
