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.
 */
package cjam;
import java.io.*;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
 *
 * @author Administrator
 */
public class Cjam {

    /**
     * @param args the command line arguments
     */

    public  BufferedWriter output;
    public Scanner input;
    public int T;
    
    
    
     public Cjam()
        {
            
            
               try {
                            input = new Scanner(new FileReader("B-small-attempt0.in")); 
                           output = new BufferedWriter(new FileWriter(new File("b.out")));
                     } 
               catch (IOException ex) {
                          Logger.getLogger(Cjam.class.getName()).log(Level.SEVERE, null, ex);
                      }
                      
               T = input.nextInt();       
               
        }
    
    
    
    
    
    
    public static void main(String[] args) {
        // TODO code application logic here
       
        Cjam c = new Cjam();
        
        
       for(int i = 1; i <= c.T ; i++)
       {
           int N,S,p,ti[],b1,b2;
           int max1=0,max2=0,max3=0,max=0;
           
           N = c.input.nextInt();
           S = c.input.nextInt();
           p = c.input.nextInt();
           ti = new int[N];
           
           for(int j=0 ; j < N ; j++)
           {
               ti[j] = c.input.nextInt();
           }
           
           if(p > 1)
           {
                   b1 = 3*(p-1) - 1;
                   b2 = 3*(p-1) ;
                   
                   for(int k = 0 ; k < N ; k++ )
                   {
                       if( ti[k] > b2 )
                       {
                           max1++;
                       }
                               
                       else if( (ti[k]==b1) || (ti[k]==b2) )
                       {
                           max2++;
                       }
                       
                   }
                   
                   
                   
              if( max2 > S )
              {
                  max = max1 + S;
              }
              else
              {
                  max = max1 + max2;
              }
           
              
              
           }
           else if(p==1)
           {
               for(int k = 0 ; k < N ; k++ )
                   {
                      if(ti[k] >= 1)
                      {
                          max1++;
                      }
                      
                      max= max1;
                      
                   }
           }
           else if(p==0)
           {
               max = N;
           }
           
           
           
           
           
            try {
                c.output.append("Case #"+i+": "+max);
                
                
                if(i != c.T)  c.output.newLine();
            } catch (IOException ex) {
                Logger.getLogger(Cjam.class.getName()).log(Level.SEVERE, null, ex);
            }
           
           
 
       
       
       }
        try {
            c.output.close();
        } catch (IOException ex) {
            Logger.getLogger(Cjam.class.getName()).log(Level.SEVERE, null, ex);
        }
     c.input.close();
       
       
    }
}
