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


/**
 * @(#)gcjB.java
 *
 *
 * @author
 * @version 1.00 2012/4/14
 */
import java.io.*;
public class gcjB {

    /**
     * Creates a new instance of <code>gcjB</code>.
     */
    public gcjB() {
    }

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here






        int lineCount;
		String[] lines;
		try
		{


			BufferedReader in = new BufferedReader(new FileReader("B.in"));
			PrintWriter out = new PrintWriter(new FileWriter("B.out"));
			String text = in.readLine();
			lineCount = Integer.parseInt(text);
			lines = new String[lineCount];



		int x =0, y =0, z =0, sup =0;

        Integer[] maxs = new Integer[100];
        Integer[] maxws = new Integer[100];
        Integer matrix[][]  = new Integer[100][2];

        String surp = new String("");
        String norm = new String("");
        for(int i = 0; i < 100 ; i ++)
        {
        	maxs[i] = 0;
        	maxws[i] = 0;
			for(x=10;x>=0;x--)
			{
				for(y=x; y>=0;y--)
				{
					for(z=y;z>=0;z--)
					{
						if((x+y+z) == i)
						{
							if(delta(x, y, z) == 1)
							{
								//ah! surprized
								maxs[i] = java.lang.Math.max(maxs[i], maxi(x, y, z));
							}
							else if(delta(x, y, z) == 2)
							{
								//eh, not surprized
								maxws[i] = java.lang.Math.max(maxws[i], maxi(x, y, z));
							}
							else
							{
								//don't care
							}
						}
						else
						{
							//don't care
						}
					}
				}
			}

			matrix[i][0] = maxs[i];
			matrix[i][1] = maxws[i];
        }



			int Ng = 0 ;
			int Spz = 0;
			int NgMax = 0;

			int sx = 0;

			int MaxGo = 0;

			for(sx = 0; sx < lineCount; sx++)
			{
				String[] whatIsLeft;
				lines[sx] = in.readLine().trim();

				whatIsLeft = lines[sx].split(" ");

				Ng = Integer.parseInt(whatIsLeft[0]);
				Spz = Integer.parseInt(whatIsLeft[1]);
				NgMax = Integer.parseInt(whatIsLeft[2]);



				for(int i=3;i<whatIsLeft.length;i++)
				{
					if(Spz > 0)
					{
						if(matrix[Integer.parseInt(whatIsLeft[i])][1] >= NgMax)
						{
							MaxGo++;
						}
						else if(matrix[Integer.parseInt(whatIsLeft[i])][0] >= NgMax)
						{
							Spz--;
							MaxGo++;
						}
					}
					else
					{
						if(matrix[Integer.parseInt(whatIsLeft[i])][1] >= NgMax)
						{
							MaxGo++;
						}
					}

				}

				out.print("Case #"+(sx+1)+": "+MaxGo);
				if(sx < lineCount-1)
				{
					out.println();
				}
				MaxGo=0;
			}

			in.close();
			out.close();
		}
		catch(Exception e)
		{
			System.out.println(e);
		}
    }

    public static int delta(int x, int y, int z)
    {
    	if((java.lang.Math.abs(x-y) < 3) && ((java.lang.Math.abs(y-z)) < 3) && (java.lang.Math.abs(z-x) < 3))
    	{
	    	if((java.lang.Math.abs(x-y) ==2) || ((java.lang.Math.abs(y-z)) ==2) || (java.lang.Math.abs(z-x) ==2))
	    	{
	    		return 1;
	    	}
	    	else if((java.lang.Math.abs(x-y) < 2) || ((java.lang.Math.abs(y-z)) < 2) || (java.lang.Math.abs(z-x) < 2))
	    	{
	    		return 2;
	    	}
	    }
    	return 0;
    }
    public static int maxi(int x, int y, int z)
    {
     	int maxim = x;
     	maxim = java.lang.Math.max(maxim, y);
     	maxim = java.lang.Math.max(maxim, z);

     	return maxim;
    }
}
