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.*;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
/**
 *
 * @author Sagar
 */
public class Dancing_With_the_Googlers
{

    Map m;
    int no_of_test_cases = 0;
    StringBuffer [] sb;
    Integer []output ;
    String inputfile = "";
    String outputfile = "";
    Integer [][] input ;
    int no_of_digits = 0;



    public void setInputOutput(String input, String output)
    {
        inputfile = input;
        outputfile = output;
    }

    public void readFile()
    {
        String line="";
        boolean firstTime = true;
        int i = 0;
         try
        {
            FileReader filename = new FileReader(inputfile);
            BufferedReader reader = new BufferedReader(filename);
            while((line=reader.readLine()) !=null)
            {
                if(firstTime)
                {
                    firstTime = false;
                    no_of_test_cases = Integer.parseInt(line);
                    System.out.println("testcases:"+no_of_test_cases);
                    output = new Integer[no_of_test_cases];
                    for (int s = 0;s<no_of_test_cases;s++)
                        output[s]= new Integer(0);
                    sb = new StringBuffer[no_of_test_cases];
                    for(int j=0;j<no_of_test_cases;j++)
                        sb[j] = new StringBuffer();
                }
                else
                {
                    sb[i++].append(line);
                }
            }

         /*   for(int k=0;k<no_of_test_cases;k++)
            {
                System.out.println(input[k][0] + " " + input[k][1] );
            } */
        }
        catch(IOException e)
        {
            System.out.println("Input File not found");
        }
    }



    public void processFile()
    {
            int p=0, special_cases=0,no_of_inputs=0;
            String [] tokens;
          for (int i=0;i<no_of_test_cases;i++)
          {
               System.out.println(sb[i].toString());
              tokens = sb[i].toString().split(" ");
              //System.out.println("Tokens"+tokens[0]+ " " +tokens[1]+ " " +tokens[2]);
              no_of_inputs = Integer.parseInt(tokens[0]);
              special_cases = Integer.parseInt(tokens[1]);
              p = Integer.parseInt(tokens[2]);

              for(int j = 0;j<no_of_inputs;j++)
              {
                int number = Integer.parseInt(tokens[j+3]);

                int result =0;
                if(number !=0 ||(number==0 && special_cases==0))
                {
                    if(number%3==0)
                    {
                        result = (number /3);
                        if(result>=p)
                            output[i]=output[i]+1;
                        else
                        {
                            if((p-result)==1 && special_cases>0)
                            {
                                output[i]=output[i]+1;
                                special_cases--;
                            }
                        }
                    }
                    else if(number%3==1)
                    {
                        result = (number/3);

                        if(result >=p || result+1 >=p)
                            output[i]=output[i]+1;
                        else if((p-result+1)==1 && special_cases>0)
                            {
                                output[i]=output[i]+1;
                                special_cases--;
                            }
                    }
                    else if(number%3==2)
                    {
                        result = (number/3);

                        if(result >=p || result+1 >=p)
                        {
                            output[i]=output[i]+1;
                        }
                        else if (result+2>=p &&special_cases>0)
                        {
                            output[i]=output[i]+1;
                            special_cases--;
                        }
                        else if((p-result+1)==1 && special_cases>0)
                            {
                                output[i]=output[i]+1;
                                special_cases--;
                            }

                    }
                }

     
              }
                //System.out.println("OutPut"+i+ +output[i]);
          }
    }

    public void displayOutput()
    {
        try
        {
            // Create file
            FileWriter fstream = new FileWriter(outputfile);
            BufferedWriter out = new BufferedWriter(fstream);
            for(int i=0;i<no_of_test_cases;i++)
            {
                out.write("Case #"+(i+1)+": ");
                out.write(output[i].toString());
                out.newLine();

            }
            //Close the output stream
            out.close();
        }
        catch (Exception e)
        {//Catch exception if any
            System.err.println("Error: " + e.toString());
        }


    }
    


    public static void main(String []args)
    {
        Dancing_With_the_Googlers obj = new Dancing_With_the_Googlers();
        obj.setInputOutput("C:\\Users\\Sagar\\Desktop\\myWork\\B-small-attempt0.in", "C:\\Users\\Sagar\\Desktop\\myWork\\output4.txt");
        obj.readFile();
        obj.processFile();
        obj.displayOutput();
    }

}
