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.
 */
package googlecodejam;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

/**
 *
 * @author Muhammad Zahran
 */
public class GooglersDance 
{
     
     public static void main(String[] args) throws IOException 
    {
        PrintWriter w =  new PrintWriter(new FileWriter("out.txt"));
        BufferedReader r = new BufferedReader(new FileReader("input.txt")); 
        
        String line = r.readLine();   
        int testcases = Integer.parseInt(line);
        for (int t = 0; t < testcases; t++) 
        {
                String[] tokens = r.readLine().split(" ");        
                int googlersCount = Integer.parseInt(tokens[0]);
                int surpCount = Integer.parseInt(tokens[1]);
                int p = Integer.parseInt(tokens[2]);

                int result = 0;

                number[] numberList = new number[googlersCount];        
                int cnt = 0;
                for (int i = 3; i < tokens.length; i++) 
                {                     
                    number n = new number();
                    n.num = Integer.parseInt(tokens[i]);
                    int scratch = n.num;
                    boolean next = true;

                     // NOT 3: 3x+2
                    if(next)
                    {  
                         scratch = n.num;
                         scratch -= 2;                
                         if(scratch%3==0)
                         {
                             int x = (scratch/3)+1;
                             int smallx = (scratch/3);
                             if(x>=p && x<=30 && smallx>=0)
                             {
                                  n.notSurp = true;
                                  next = false;
                             }
                         }

                    }
                     // NOT 2: 3x+1
                    if(next)
                    {  
                         scratch = n.num;
                         scratch -= 1;                
                         if(scratch%3==0)
                         {
                             int x = (scratch/3)+1;
                              int smallx = (scratch/3);
                            if(x>=p && x<=30 && smallx>=0)
                             {
                                  n.notSurp = true;
                                  next = false;
                             }
                         }
                    }            
                    //NOT 1: 3x
                    if(next)
                    {                
                         scratch = n.num;                              
                         if(scratch%3==0)
                         {
                             int x = (scratch/3);
                              int smallx = (scratch/3);
                             if(x>=p && x<=30 && smallx>=0)
                             {
                                  n.notSurp = true;                         
                             }
                         }               
                    }
                    next = true;                                  
                /////////////////////////////                 
                    // SURP 3: 3x+4
                    if(next)
                    {
                         scratch = n.num;
                         scratch -= 4;                
                         if(scratch%3==0)
                         {
                             int x = (scratch/3)+2;
                              int smallx = (scratch/3);
                             if(x>=p && x<=30 && smallx>=0)
                             {
                                  n.surp = true;
                                  next = false;
                             }
                         }
                    }
                     // SURP 2: 3x+3
                    if(next)
                    {
                         scratch = n.num;
                         scratch -= 3;                
                         if(scratch%3==0)
                         {
                             int x = (scratch/3)+2;
                              int smallx = (scratch/3);
                            if(x>=p && x<=30 && smallx>=0)
                             {
                                  n.surp = true;
                                  next = false;
                             }
                         }
                    }

                    // SURP 1: 3x+2
                    if(next)
                    {
                         scratch = n.num;
                         scratch -= 2;                
                         if(scratch%3==0)
                         {
                             int x = (scratch/3)+2;
                              int smallx = (scratch/3);
                             if(x>=p && x<=30 && smallx>=0)
                             {
                                  n.surp = true;
                                  next = false;
                             }
                         }
                    }  

                    numberList[cnt] = n;
                    cnt++;
                } 

                int dummyS = surpCount;
                for (int i = 0; i <numberList.length ; i++) 
                {
                    if(numberList[i].notSurp==false && numberList[i].surp==false)
                    {

                    }
                    else if(numberList[i].notSurp==false && numberList[i].surp==true && dummyS>0)
                    {
                        dummyS--;
                        result++;
                    }
                    else if(numberList[i].notSurp==true && numberList[i].surp==false)
                    {
                        result++;
                    }
                    else if(numberList[i].notSurp==true && numberList[i].surp==true)
                    {
                        result++;
                    }
                }
                int asd = t+1;
                w.println("Case #" + asd + ": " + result);
        }
        
        w.close();
        
    }
       
    
}
