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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingGooglers
{
    public int googlers( int surprise, int mincount, int[] scores )
    {
        int counter = 0;
        for( int i = 0; i < scores.length; i++ )
        {
            int s = scores[i] % 3;
            int base = scores[i] / 3;
            if( s == 0 )
            {
                if( base >= mincount )
                {
                    counter++;
                }
                else
                {
                    if( surprise > 0 && base > 0 && base + 1 >= mincount )
                    {
                        counter++;
                        surprise--;
                    }
                }
            }
            else if( s == 1 )
            {
                if(base >= mincount || base +1 >= mincount)
                {
                    counter++;
                }
                else
                {
                    if(surprise > 0 && base +1 >= mincount)
                    {
                        counter++;
                        surprise--;
                    }
                }    
                
            }
            else if( s == 2 )
            {
                if(base >= mincount || base +1 >= mincount)
                {
                    counter++;
                }
                else
                {
                    if(surprise > 0 && base +2 >= mincount)
                    {
                        counter++;
                        surprise--;
                    }
                }    
                
            }
        }
        return counter;
    }

    public static void main( String[] args )
    {
        DancingGooglers dg = new DancingGooglers();

        try
        {
            FileWriter fw = new FileWriter( "output.out" );
            BufferedWriter out = new BufferedWriter( fw );

            FileReader fr = new FileReader( "in.in" );
            BufferedReader br = new BufferedReader( fr );
            String size = br.readLine();

            String temp = "";
            int k = 0;
            while( ( temp = br.readLine() ) != null )
            {                
                String[] split = temp.trim().split( " " );
                int googlercount = Integer.parseInt( split[0] );
                int surprise = Integer.parseInt( split[1] );
                int mincount = Integer.parseInt( split[2] );
                int[] scores = new int[googlercount];
                for(int i = 0;i<googlercount;i++)
                {
                    scores[i] = Integer.parseInt( split[i + 3] );
                }
                out.write( "Case #" + ( ++k ) + ": " + dg.googlers( surprise, mincount, scores ) + "\n" );
            }
            
            fr.close();
            out.close();
        }
        catch( FileNotFoundException e )
        {
            e.printStackTrace();
        }
        catch( IOException e )
        {
            e.printStackTrace();
        }
    }
}
