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.*;
import javax.swing.*;
import javax.swing.JOptionPane.*;
import java.awt.*;
import java.awt.event.*;
import java.io.*;
import javax.swing.text.*;
import java.io.File;
import javax.swing.filechooser.FileFilter;
import javax.swing.text.html.*;
import java.util.Scanner;
import java.util.StringTokenizer;

class Dancings
{
   public static void main(String args[])
	{
	  
	  int jumlahN[]=new int[101];
	 
	 
	  
	  int hasil[]=new int[101];
	  
	  
	  int i=0;
      int j=0;
      int k=0;
      int l=0;
	  int il=0;
	  int cok3=0;
	  
      try{
		// Open the file that is the first 
		// command line parameter
		FileInputStream fstream = new FileInputStream("b.txt");
		// Get the object of DataInputStream
		DataInputStream in = new DataInputStream(fstream);
        BufferedReader br = new BufferedReader(new InputStreamReader(in));
		String strLine;
		//Read File Line By Line
		j=0;
		while ((strLine = br.readLine()) != null) 	{
			// Print the content on the console
		    if(j==0)
            {
             i=Integer.parseInt(strLine);	
             if(i>100)
              {
	           i=100;
              }
             else if(i<1)
              {
	           i=1;
              } 			
			 System.out.println (i);
		    }
			else
			{
			 int jum=0;
			 int panjangtext=strLine.length();
			 int posisi=0;
			 //String isi=strLine.trim();
			 char arr[]=strLine.toCharArray(); 

			 Character n2=arr[0];
             String s1=n2.toString();
             int n= Integer.parseInt(s1);			 
			 
			  String tmp="";
			  for(l=2; l<panjangtext; l++)
			  {
				 if(arr[l]==' ')
				 {
			        break;
				 }
				 else
				 {
				  tmp=tmp+arr[l];
				 }
			  } 
			  
			  int s=Integer.parseInt(tmp);
			  
			  String tmp2="";
			  for(k=l+1; k<panjangtext; k++)
			  {
				 if(arr[k]==' ')
				 {
			        break;
				 }
				 else
				 {
				  tmp2=tmp2+arr[k];
				 }
			  } 
			  
			  int p=Integer.parseInt(tmp2);	
			  
			  System.out.println("nilai n"+n);
			  System.out.println(strLine);
			  
			  System.out.println("nilai s:"+s);
			  System.out.println("nilai p:"+p);
			  
			  int m=1;
			  tmp="";
			  while(m<=n)
			  {
			     
			    for(k=k+1; k<panjangtext; k++)
			    {
				 if(arr[k]==' ')
				 {
				   
			        break;
				 }
				 else
				 {
				  
				  tmp=tmp+arr[k];
				 }
			    }
				 
				 tmp=tmp.trim();
				 int tmp4=Integer.parseInt(tmp);	
			     jumlahN[m]=tmp4;
				 tmp=" ";
			    
			   
			   m++;
			  }
			  
			  m=1;
			  
			  int p2=p*2;
			  while(m<=n)
			  {
			    
			   System.out.println("nilai m :"+m+" :"+jumlahN[m]);
			   int cok2=jumlahN[m];
			   int jos=cok2-p2;
			   int param=p-2;
			   if(jos>=param)
			   {
			    
			     System.out.println("Masuk 1");
			    jum++;
			   }
			   else if(cok2>0 && s>0)
			   {
			    cok3=cok2-p;
				int p3=cok3/2;
				
				if(p3>=param)
				{
				jum++;
				s--;
				}
			     System.out.println("Masuk 2");
			    
			   }
			  
			  
			   
			   m++;
			  }
			  
			  hasil[j]=jum; 
            }
		//Close the input stream
		    j++;
		   }
	       in.close();
		}
		catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
		
		
		
      
	  try
	  {
	   File makefile= new File("resultdancing.txt");
       FileWriter fwrite= new FileWriter(makefile);
       PrintWriter pw=new PrintWriter(fwrite);	 
	   for(il=1; il<=i; il++)
         {
		  pw.println("Case #"+(il)+": "+hasil[il]+"\n");
		  System.out.println("case #"+(il)+": "+hasil[il]+"\n");
		 }
	   fwrite.flush();
	   fwrite.close();
	  }
	  catch(IOException e)
	  {
	   e.printStackTrace();
	  }
	  
	  
	}
	

	

  

	
	
	
}

