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;
	}
	
	
}


import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

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

/**
 *
 * @author home
 */
public class DancingWithGooglers {
    public static void main(String args[])throws IOException{
     FileReader reader = new FileReader("D:\\NetBeansProjects\\DBInteractionWithWS\\src\\java\\B-small-attempt7.in");
		BufferedReader br = new BufferedReader(reader);
		File file = new File("d:\\rloutput.txt");
		FileWriter fw = new FileWriter(file);
		int count = Integer.parseInt(br.readLine());
		for(int s=0;s<count;s++){
                    List list = new ArrayList();
                    String line = br.readLine();
                    //System.out.println(line);
                    int num = Integer.parseInt(line.split(" ")[0]);
                    int triplets =Integer.parseInt(line.split(" ")[1]);
                    int pendingtriplets = triplets;
                    int highest=Integer.parseInt(line.split(" ")[2]);
                    String splits[]=line.split(" ");
                    int resultCount=0;
                    int surpriseCount=0;
                    for(int i=3;i<num+3;i++){
                        
                     
                        int number =Integer.parseInt(splits[i]);
                        Bean be = new Bean();
                        if(number%3==0){
                        
                            
                            be.first =number/3;
                            be.second=number/3;
                            be.third = number/3;
                            if(be.first>=highest){
                                resultCount++;
                            }
                            
                        }else if(number%3==1){
                            
                            be.first= number/3;
                            be.second = number/3;
                            be.third = (number/3)+1;
                            if(be.third>=highest){
                                    resultCount++;
                                    
                                }
                        
                        }else if(number%3==2){
                            if((number/3)==9){
                                be.first=number/3;
                                be.second=be.first+1;
                                be.third=be.first+1;
                                if(be.second>=highest){
                                    resultCount++;
                                  
                                }
                            }else if(pendingtriplets==0){
                                be.first=number/3;
                                be.second=be.first+1;
                                be.third=be.first+1;
                                if(be.second>=highest){
                                    resultCount++;
                                  
                                }
                            }
                            else{
                                be.first=number/3;
                                be.second=(number/3)+2;
                                be.third=number/3;

                                if(be.second>=highest){
                                    resultCount++;
                                    surpriseCount++;
                                    pendingtriplets--;
                                }
                            }
                        }
                    list.add(be);
                    
                    
                    
                    
                    }
                    //System.out.println("triplets :"+triplets+", surprise "+surpriseCount);
                    
                    if(triplets>surpriseCount){
                         for(int cc=0;cc<list.size();cc++){
                             if(triplets>surpriseCount){
                                 //System.out.println("triplets :"+triplets+", surprise "+surpriseCount);
                             Bean be1 = (Bean)list.get(cc);
                           //  System.out.println(be1.first+","+be1.second+","+be1.third);
                             if(((be1.first==be1.second)&&(be1.second==be1.third))&&be1.first!=10&&be1.first!=0){
                             
                                 if((be1.first+1)>=highest){
                                 
                                     be1.first=be1.first-1;
                                     
                                     be1.third =be1.third+1;
                                     if(!(be1.second>=highest))
                                     resultCount++;
                                     surpriseCount++;
                                    
                                 }else if((be1.first-1)>=highest){
                                     be1.first=be1.first-1;
                                     be1.third =be1.third+1;
                                     if(!(be1.second>=highest))
                                     resultCount++;
                                     surpriseCount++;
                                    
                                 }
                             }
                             
                          //   list.add(cc,be1);
                         }
                         }
                    }
                    System.out.println("Case #"+(s+1)+": "+resultCount);
            }
        }
}
class Bean{
    int first;
    int second;
    int third;
}