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 java.util.*;
public class Qual22B
{
	public static void main(String[] args) throws IOException
	{
		BufferedReader ips=new BufferedReader(new FileReader("B-small-attempt2.in"));
		PrintWriter ops=new PrintWriter(new FileWriter("dwgop.in"));
		int T=Integer.parseInt(ips.readLine());
		for(int i=0; i<T;i++)
		{
			String line=ips.readLine();
			char[] ca=line.toCharArray();
			int j=0, G=0, S=0, p=0;
			for(j=0; ca[j]!=' ';j++)
				G=(G*10)+(ca[j]-'0');
			//System.out.println("Googlers: "+G);
			j++;
			for( ; ca[j]!=' ';j++)
				S=(S*10)+(ca[j]-'0');
			j++;
			//System.out.println("Surprises: "+S);
			for( ; ca[j]!=' ';j++)
				p=(p*10)+(ca[j]-'0');
			//System.out.println("Best score: "+p);
			j++;
			int[] ts= new int[G];
			for(int k=0; k<G; k++)
				ts[k]=0;
			for(int k=0; k<G;k++)
			{
				while( j<ca.length  && ca[j]!= ' ')
				{
					ts[k]=(ts[k]*10)+(ca[j]-'0');
					//System.out.print(ts[k]+" ");
					j++;
				}
				j++;
			}
			//System.out.println("");
			Arrays.sort(ts);
			int mod=0, sc=0, count=0;
			int[][] marks=new int[G][3];
			for(int k=G-1; k>=0; k--)
			{
				mod=ts[k]%3;
				for(int l=0; l<3; l++)
					marks[k][l]=ts[k]/3;
				if(mod==2)
				{
					if(sc<S && marks[k][0]!=9 && (((ts[k]/3)+2) == p )) 
					{
						marks[k][0]= marks[k][0]+2;
						sc++;
					}
					else
					{
						for(int l=0; l<2; l++)
							marks[k][l]=marks[k][l]+1;
					}		
				}
				else
				{
					if(mod==1)
					{
						marks[k][0]=marks[k][0]+1;
					}
					else
					{
						if(mod==0 && (((ts[k]/3)+1) ==p) && (ts[k]/3 != 0))
						{
							if(sc<S)
							{
								marks[k][0]=marks[k][0]+1;
								marks[k][1]=marks[k][1]-1;
								sc++;
							}
						}
					}
				}
			} 
			for(int k=0; k<G; k++)
			{
				for(int l=0; l<3; l++)
				{
					//System.out.print(marks[k][l]+" ");
					if(marks[k][l]>=p)
					{
						count++;
						break;
					}
				}
				//System.out.println("");
			}
			ops.println("Case #"+(i+1)+": "+count);
		}
		ips.close();
		ops.close();
	}
}