package googlers;

import java.util.Scanner;
import java.util.PriorityQueue;
import java.util.Comparator;
public class Googlers {
	
	public static void main(String[] args) {
		
		int n,s,p,count=0,t;		
		Scanner sin=new Scanner(System.in);
		
		t=Integer.parseInt(sin.nextLine());
		
		
		int result[]=new int[t];
		int j=0;
		
		if(t>=1 && t<=100)
		{
		for (int k = 0; k < t; k++) {
		count=0;	
		
			
        String ip = sin.nextLine();
        
        String[]tokens=ip.split(" ");
		
		
		n=Integer.parseInt(tokens[0]);
		s=Integer.parseInt(tokens[1]);
		p=Integer.parseInt(tokens[2]);
		
		if( (s>=0 && s<=n) && (p>=0 && p<=10) )
		{
		int[] total=new int[n];
		
		
		for (int i = 0; i < n; i++)
        {
            total[i] = Integer.parseInt(tokens[i+3]);
        }
		
		Comparator comparator=new PointComparator();
		PriorityQueue pq=new PriorityQueue<Point>(1, comparator);
		
		for (int i = 0; i < n; i++)
		{
			
			int x=total[i]/3;
			int r=total[i]%3;
			if(x>=p)
				count++;
			else if(x<(p-2))
				continue;
			else
			{
				//System.out.println("enter "+x+" "+(p-2));
				if(p-x==1)
				{
					Point temp=new Point();
					temp.q=x;
					temp.r=r;
					pq.add(temp);
				}
				else  // p-x=2
				{
					if(r==0)
						continue;
					else
					{
						Point temp=new Point();
						temp.q=x;
						temp.r=r;
						pq.add(temp);
					}				
					
				}
					
			}
			//System.out.println("hi "+pq.size());
			
		}
		
		
		
		while(pq.size()!=0)
		{
			Point temp=(Point)pq.remove();
			if(p-temp.q==1 && temp.q!=0)
			{
				if(temp.r>=1)
					count++;
				else
				{
					if(s!=0)
					{
						s--;
						count++;
					}
				}
			}
			else if(p-temp.q==2)
			{
				if(s!=0 && (temp.q+temp.r)>=p)
				{
					s--;
					count++;
				}
			}
			
				
		}
		
		//System.out.println(p);
		
		result[j++]=count;
		
		}
		}
		
		for (int i = 0; i < t; i++) 
		{
			System.out.println("Case #"+(i+1)+": "+result[i]);
		}
		}
		
	}
        
        
		
		/*Point x=new Point();
		x.q=8;
		Point y=new Point();
		y.q=6;
		Point z=new Point();
		z.q=7;
		
		pq.add(x);
		pq.add(y);
		pq.add(z);
		*/
		
		
		
		
	

}

class PointComparator implements Comparator<Point>
{
    @Override
    public int compare(Point x, Point y)
    {
        // Assume neither string is null. Real code should
        // probably be more robust
        if (x.q < y.q)
        {
            return 1;
        }
        if (x.q  > y.q)
        {
            return -1;
        }
        return 0;
    }
}



class Point
{
	int q,r;

	public int getQ() {
		return q;
	}

	public void setQ(int q) {
		this.q = q;
	}

	public int getR() {
		return r;
	}

	public void setR(int r) {
		this.r = r;
	}
	
	
}

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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.*;
/**
 *
 * @author GERALD
 * JDK 7.0
 */
public class GoogleDancing {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner scanner = null;
        PrintWriter output = null;
         try{
         scanner = new Scanner(new FileInputStream(args[0]));
         output = new PrintWriter(new FileOutputStream("resultGoogleDancing.txt"));
         int noOfCases = scanner.nextInt();
         int noOfGooglers, minBestScore, surpScrs, count;
         //prior initializations if any
         List<Integer> totalScoresList = new Vector<>();
         int [] buffer;
         for(int i=1; i<= noOfCases;++i){
             // TODO code application logic here
             noOfGooglers= scanner.nextInt();
             surpScrs = scanner.nextInt();
             minBestScore = scanner.nextInt();
             buffer = new int [noOfGooglers];
             totalScoresList.clear();
             for(int j=0; j<noOfGooglers; ++j){
                 buffer[j] = scanner.nextInt();
                 
             }
             Arrays.sort(buffer);
             for(int j=noOfGooglers-1; j>=0; --j){
                 totalScoresList.add(buffer[j]);
             }
             count = 0;
             count = checkListNormally(totalScoresList,minBestScore,count);
             //System.out.println(Arrays.toString(totalScoresList.toArray()));
             count = checkListWithSurprise(totalScoresList,minBestScore,count,surpScrs);
             //System.out.println(Arrays.toString(totalScoresList.toArray()));
             //System.out.println("*****");
             output.append(String.format("Case #%d: %d\n",i,count));
         }
         
         } catch (FileNotFoundException ex) {
            ex.printStackTrace();
        }  finally{
            if( output!= null)
                output.close();
            if(scanner!= null)
                scanner.close();
        }
    }

    private static int checkListNormally(List<Integer> totalScoresList, int minBestScore, int count) {
        int  num, ave,mod; 
        Iterator ite = totalScoresList.iterator();
        while(ite.hasNext()){
            //System.out.println("____________");
            num = (int) ite.next();
            ave = num/3;
            mod = num%3;
            if(num == 0&& 0==minBestScore){
                count ++;
                ite.remove();
            }else if(mod == 1 && ave ==0 && ave+1>= minBestScore){
                count ++;
                ite.remove();
            }else if(mod == 2 && ave ==0 && ave+1>=minBestScore){
                count++;
                ite.remove();
            }
            else{
                if(ave!=0){
                if(mod == 0 && ave >= minBestScore ){
                    count ++;
                    ite.remove();
                }
                else if( mod == 1 || mod == 2){
                    if(ave+1 >= minBestScore){
                        count++;
                        ite.remove();
                    }
                }
                }
            }
              //  System.out.println(Arrays.toString(totalScoresList.toArray()));
               // System.out.println("_____________");
            
            }
           
        //System.out.println(Arrays.toString(totalScoresList.toArray()));
        return count;
    }

    private static int checkListWithSurprise(List<Integer> totalScoresList, int minBestScore, int count, int surpScrs) {
        int num, ave, mod;
        int i=0;
        Iterator ite = totalScoresList.iterator();
        while(ite.hasNext() && i<surpScrs ){
            num = (int) ite.next();
            ave = num/3;
            mod = num%3;
            if(num ==0 && 0==minBestScore){
                count ++;
                ite.remove();
            }else if(mod == 1 && ave ==0 && ave+1>= minBestScore){
                count ++;
                ite.remove();
            }else if(mod == 2 && ave ==0 && ave+2>=minBestScore){
                count++;
                ite.remove();
            }
            else{
                if(ave!=0){
                if(mod == 2 && ave+2 >= minBestScore ){
                    count ++;
                    ite.remove();
                }
                else if( mod == 0 || mod == 1){
                    if(ave+1 >= minBestScore){
                        count++;
                        ite.remove();
                    }
                }
                }
                
            }
            i++;
            }
          
        return count;
    }

}
