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

/*
 * Program Name :- B.java
 * Author :- Happy Mittal
 * Created on 14 April, 2012
 *
 * 
 */

package googlecodejam11;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.Arrays;

public class B {
    /** Creates a new instance of B */
    public B() {
        try{
            // Open the input file 
            FileInputStream finstream = new FileInputStream("E:\\B-small-attempt0.in");
            // FileInputStream finstream = new FileInputStream("E:\\B-large-attempt0.in");
            //FileInputStream finstream = new FileInputStream("E:\\test-input.in");
            // Get the object of DataInputStream
            DataInputStream in = new DataInputStream(finstream);
                BufferedReader br = new BufferedReader(new InputStreamReader(in));
                
             // Create a output file 
            FileWriter foutstream = new FileWriter("E:\\B-small-output.in");
          //   FileWriter foutstream = new FileWriter("E:\\B-small-output.in");
              //FileWriter foutstream = new FileWriter("E:\\test-output.in");
                BufferedWriter bw = new BufferedWriter(foutstream);
                
            br.readLine(); // read the first line it contains no of cases
            String strLine;
            int caseno = 1;
            //Read File Line By Line
           // strLine = br.readLine();
            while ((strLine = br.readLine()) != null)   {
              // Print the content on the console
             // System.out.println (strLine);
              strLine = strLine.trim();
              int result = NoOFTriplets(strLine); 
              //System.out.println (result);
              String netresult = "Case #" + caseno + ": " + result ;
              bw.write(netresult);
              bw.newLine();
              caseno ++;
            }
            
            
            //Close the input stream
            in.close();
            //Close the output stream
            bw.close();
       
            }catch (Exception e){//Catch exception if any
              System.err.println("Error: " + e.getMessage());
            }
    }
     public static void main(String[] args) {
        // TODO code application logic here
        B b1 = new B();
           }
     public int NoOFTriplets(String str){
            String input[] = str.split(" ");
            int MaxGooglers = 0 ;
            int N = Integer.parseInt(input[0]);
            int S = Integer.parseInt(input[1]);
            int p = Integer.parseInt(input[2]);
           // int value[] = new int[N];
            for(int i=0;i<N;i++)
            {
                int score = Integer.parseInt(input[i+3]);
                if(score <= 1) 
                {
                    if(score >= p) MaxGooglers ++;
                    continue;
                }
                int div = score   / 3 ;
                int rem =  score % 3;
                //System.out.println ("Values  " + div + " --   " + rem);
                if(rem != 0 ) div ++;
                if (div >= p)
                {
                    MaxGooglers ++;
                    // System.out.println ("Hello1");
                }
                else if(S > 0 && rem != 1 && div + 1 >= p )
                {
                    // System.out.println (S + "Hello2");    
                    MaxGooglers ++;
                        S--;
                }
            }
            
           return MaxGooglers;
     }
}
