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 javaapplication1;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
/**
 *
 * @author kutub
 */
public class dwg {
    
    public boolean valid(int score1,int score2,int score3,int total)
    {
        if(score1>=0 && score2>=0 && score3>=0 && score1+score2+score3==total)
        {
            return true;
        }
        else
            return false;
    }
    public boolean same(int s1,int s2,int s3)
    {
        if(s1==s2 && s2==s3)
        {
            return true;
        }
        else
            return false;
    }
    public boolean surprising(int score1,int score2,int score3)
    {
        if(Math.abs(score1-score2)==2 || Math.abs(score2-score3)==2 || Math.abs(score3-score1)==2)
        {
            return true;
        }
        else
            return false;
    }
    public int possibilities(int [] total,int b,int sur)
    {
        int best=0,sc=0,score1=0,score2=0,score3=0;
        for(int i=0;i<total.length;i++)
        {
        if(total[i]%3!=0)
        {
            score1=Math.round(total[i]/3);
            score2=Math.round(total[i]/3)+1;
            score3=Math.round(total[i]/3);
            if(valid(score1, score2, score3, total[i]))
            {
                
                    
                    if(score1>=b || score2>=b || score3>=b)
                    {
                        best++;
                    }
                    else
                    {
                        if(sc<sur)
                        {
                            score1++;
                            score3--;
                            if(valid(score1, score2, score3, total[i]))
                            {
                                if(score1>=b || score2>=b || score3>=b)
                                {
                                    best++;
                                }
                                else
                                {
                                    sc--;
                                }
                                if(surprising(score1, score2, score3))
                                {
                                    sc++;
                                }
                            }
                        }
                    }
                    
                }
               
            else
            {
                score1=Math.round(total[i]/3);
                score2=Math.round(total[i]/3)+1;
                score3=Math.round(total[i]/3)+1;
                if(valid(score1, score2, score3, total[i]))
                {
                    if(score1>=b || score2>=b || score3>=b)
                    {
                        best++;
                    }
                    else
                    {
                        if(sc<sur)
                        {
                            score2++;
                            score3--;
                            if(valid(score1, score2, score3, total[i]))
                            {
                                if(score1>=b || score2>=b || score3>=b)
                                {
                                    best++;
                                }
                                else
                                {   
                                    sc--;
                                }
                                if(surprising(score1, score2, score3))
                                {
                                    sc++;
                                }
                            }
                        }
                    }
                }
                
            }
        }
        else
        {
            score1=Math.round(total[i]/3);
            score2=Math.round(total[i]/3);
            score3=Math.round(total[i]/3);
            
            if(valid(score1, score2, score3, total[i]))
            {
                if(score1>=b || score2>=b || score3>=b)
                    {
                        best++;
                    }
                    else
                    {
                        if(sc<sur)
                        {
                            score2++;
                            score3--;
                            if(valid(score1, score2, score3, total[i]))
                            {
                                if(score1>=b || score2>=b || score3>=b)
                                {
                                    best++;
                                }
                                else
                                {
                                    sc--;
                                }
                                if(surprising(score1, score2, score3))
                                {
                                    sc++;
                                }
                            }
                        }
                    }
            }
        } 
    }
       
            return best;
       
    }
    
    
    public static void main(String args[]) throws FileNotFoundException
    {
        File f=new File("C:/Users/kutub/Documents/NetBeansProjects/JavaApplication1/src/javaapplication1/input1.txt");
        Scanner s=new Scanner(f);
        int n=0,noofg=0,sur=0,b=0,best=0,sc=0;
        int score[];
        while(s.hasNext())
        {
            n=s.nextInt();
            for(int j=1;j<=n;j++)
            {
                s.nextLine();
                noofg=s.nextInt();
                score=new int[noofg];
                sur=s.nextInt();
                b=s.nextInt();
                for(int i=0;i<noofg;i++)
                {
                    score[i]=s.nextInt();
                    
                }
                dwg d=new dwg();
                best=d.possibilities(score, b, sur);
                System.out.print("Case #"+j+": ");
                System.out.println(best);
            }
            
        }
        
    }
    
}
