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

/**
 *
 * @author Bhanu
 */

import java.util.*;

public class DancingGooglers {

public static void main(String arg[]) throws Exception
{

    int s1[] = {0,1,2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30};
 int    h1[] = {0,1,1, 1, 2, 2, 2, 3, 3, 3, 4,  4,  4,  5,  5,  5,  6,  6,  6,  7,  7,  7,  8,  8,  8,  9,  9,  9, 10, 10,  10};
  int   s2[]   = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28};
   int  h2[]  = {2, 2, 2, 3, 3, 3, 4, 4, 4,   5,  5,  5,  6,  6,  6,  7,  7,  7,  8,  8,  8,  9,  9,  9,  10, 10,10};

   /*TreeSet<Integer> st = new TreeSet<Integer>();
    st.add(0);
    int low = 0;
    int high = 1;
    for(;high <= 10;)
    {
        st.add(high + 2 * low);

       // System.out.println("Adding " + low +" :"+  low + ": " +  high);
        st.add(2* high +  low);
        //System.out.println("Adding " + low +" :"+  high + ": " +  high);

        st.add(3 *high );
        //System.out.println("Adding " + high +" :"+  high + ": " +  high);

        low = high;
        high++;

       
    }

     System.out.println(st);
*/
   
     /*TreeSet<Integer> st1 = new TreeSet<Integer>();

     for(int i = 2 ;i <= 10; i++)
     {
        st1.add(i + (i -2) + (i -2));
        System.out.println("Adding " + (i - 2) + " " + (i - 2) + " " + i);

        st1.add(i + (i -1) + (i -2));
        System.out.println("Adding " + (i - 2) + " " + (i - 1) + " " + i);

        st1.add(i + (i ) + (i -2));
        System.out.println("Adding " + (i - 2) + " " + (i ) + " " + i);

     }
     System.out.println(st1);
     System.out.println(st1.size());
      *
      */


   java.io.BufferedReader bin = new java.io.BufferedReader(new java.io.InputStreamReader (System.in));
  int T = Integer.parseInt( bin.readLine() );
  for(int i = 1; i <= T ; i++)
  {
            String[] split = bin.readLine().split(" ");
            int N = Integer.parseInt(split[0]);
            int S = Integer.parseInt(split[1]);
            int p = Integer.parseInt(split[2]);

            int tot[] = new int[N];

            for(int k = 3; k < split.length;k++)
            {
                tot[k - 3] = Integer.parseInt(split[k]);
            }

            Arrays.sort(tot);
              int count = 0;

            for(int k = N  -1 ; k >= 0 ; k--)
            {
                int t = tot[k];
                boolean n1 = false;
                boolean n2 = false;
                if(h1[t] >= p) n1 = true;

                if( t >= 2 && t <= 28)
                {
                    if( S > 0 && h2[t-2] >= p) n2 = true;
                }

                if(n1 == false && n2 == false){

                }
                else if(n1 == false && n2 == true)
                {
                   count++;
                    S--;
                }
                else if(n1 == true && n2 == false)
                {
                    count++;
                }
                else if(n1 == true && n2 == true)
                {
                    count++;
                   
                }
            }

              System.out.println("Case #" + i + ": " + count);
  }

}

}
