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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */


import java.io.BufferedReader;
import java.io.IOException;

import java.io.InputStreamReader;


/**
 *
 * @author harit
 */
public class Main {

    /**
     * @param args the command line arguments
     */
  
    public static void main(String[] args) throws IOException {


       int normal[][]=          {{0,0,0},
                                {0,0,1},
                                {0,1,1},
                                {1,1,1},
                                {1,1,2},
                                {1,2,2},
                                {2,2,2},
                                {2,2,3},
                                {2,3,3},
                                {3,3,3},
                                {3,3,4},
                                {3,4,4},
                                {4,4,4},
                                {4,4,5},
                                {4,5,5},
                                {5,5,5},
                                {5,5,6},
                                {5,6,6},
                                {6,6,6},
                                {6,6,7},
                                {6,7,7},
                                {7,7,7},
                                {7,7,8},
                                {7,8,8},
                                {8,8,8},
                                {8,8,9},
                                {8,9,9},
                                {9,9,9},
                                {9,9,10},
                                {9,10,10},
                                {10,10,10}
                                };
       int surp[][]={   {-1,-1,-1},
                        {-1,-1,-1},
                        {0,0,2},
                        {0,1,2},
                        {0,2,2},
                        {1,1,3},
                        {1,2,3},
                        {1,3,3},
                        {2,2,4},
                        {2,3,4},
                        {2,4,4},
                        {3,3,5},
                        {3,4,5},
                        {3,5,5},
                        {4,4,6},
                        {4,5,6},
                        {4,6,6},
                        {5,5,7},
                        {5,6,7},
                        {5,7,7},
                        {6,6,8},
                        {6,7,8},
                        {6,8,8},
                        {7,7,9},
                        {7,8,9},
                        {7,9,9},
                        {8,8,10},
                        {8,9,10},
                        {8,10,10},
                        {-1,-1,-1},
                        {-1,-1,-1}
                        };
           BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
           int t=Integer.parseInt(br.readLine());
           int t1=1;
           while(t1<=t){
		 String st=br.readLine();
		 //System.out.println(st); 
		 if(st!=null){
			//System.out.println("null");
	               String s[]=st.split(" ");
               //int n=Integer.parseInt(s[0]);
               		int sp=Integer.parseInt(s[1]);
               		int p=Integer.parseInt(s[2]);
               		int maxcount=0;
               		for(int i=3;i<s.length;i++){
                  		 int ttl=Integer.parseInt(s[i]);
                   		int p1=normal[ttl][2];
                   		if(p1>=p) maxcount++;
                   		else if(sp>0){
                     		  p1=surp[ttl][2];
                       		  if(p1>=p) {maxcount++;  sp--;}
                  	 	}
			}
			System.out.println("Case #"+t1+": "+maxcount);	
			
               }
		t1++;               

           }

    }

}
