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.BufferedReader;
import java.io.IOException;
import java.io.FileReader;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.StringTokenizer;
import java.util.ArrayList;

public class TestJAM
{
	public static void main (String[] args)
	{
		BufferedReader br = null;
		PrintStream ps = null;
		
		try
		{
			int t;
			int n;
			int s;
			int p;
			
			int count;
			int countsurprisingoblig;
			int countimp;
			
			ArrayList<Integer> scores;

			String line;
			StringTokenizer st;
						
			br = new BufferedReader (new FileReader ("B-small-attempt0.in"));
			ps = new PrintStream (new FileOutputStream ("B-small-attempt0.out"));
						
			line = br.readLine ();
			t = Integer.parseInt (line);
			
			for (int testCase = 0; testCase < t; testCase++)
			{
				count = 0;
				countsurprisingoblig = 0;
				countimp = 0;
				
				line = br.readLine ();
				st = new StringTokenizer (line);
				
				n = Integer.parseInt (st.nextToken ());
				s = Integer.parseInt (st.nextToken ());
				p = Integer.parseInt (st.nextToken ());

				scores = new ArrayList ();
				
				for (int scoreInputIndex = 0; scoreInputIndex < n; scoreInputIndex++)
				{
					scores.add (Integer.parseInt (st.nextToken ()));
				}
				
				for (int score : scores)
				{
					int diff = (int) Math.abs (score - (3*p));
					
					if ((score < (3 * p)) && ((diff == 3 || diff == 4)) && (score != 0) && (p > 0))
					{
						countsurprisingoblig++;
					}
					else if (((score < (3 * p)) && (diff > 4)) || ((score == 0) && (p > 0)))
					{
						countimp++;
					} 
				}
				
				count = scores.size () - countimp - countsurprisingoblig;
				
				if (countsurprisingoblig > s)
				{
					count += s;
				}
				else
				{
					count += countsurprisingoblig;
				}
				
//				System.out.println (count);
//				System.out.println (n + " " + s + " " + p + " " + scores.toString ());
//				System.out.println ("Case #" + (testCase + 1) + ": " + s);				

				ps.println ("Case #" + (testCase + 1) + ": " + count);
			}
						

//			ps.println ("test1 test1 test1");
			
//			System.out.println ("Hola Mundo!!!");			
		}
		catch (IOException ioe)
		{
			ioe.printStackTrace ();
		}
		catch (NumberFormatException nfe)
		{
			nfe.printStackTrace ();
		}
		finally
		{
			if (ps != null)
			{
				ps.close ();
			}
			if (br != null)
			{
				try
				{
					br.close ();					
				}
				catch (IOException ioe)
				{
					ioe.printStackTrace ();
				}
			}
		}
	}	
}




