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.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map.Entry;
import java.util.Set;

public class CodeJam2
{

    private class Data
    {
        private int num;
        private int surprise;
        private int threshold;
        private Integer[] values;

        public Data(int num, int surprise, int threshold, Integer[] values)
        {
            this.num = num;
            this.surprise = surprise;
            this.threshold = threshold;
            this.values = values;
        }

        public int getNum()
        {
            return num;
        }

        public int getSurprise()
        {
            return surprise;
        }

        public int getThreshold()
        {
            return threshold;
        }

        public Integer[] getValues()
        {
            return values;
        }

        public String toString()
        {
            return num + " " + surprise + " " + threshold + " " + values.length;
        }
    }

    private List<Data> getInputValue()
    {
        List<Data> inpVal = new ArrayList<Data>();

        BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
        try
        {
            final String tc_ = stdin.readLine();
            Integer testCase = Integer.parseInt(tc_);

            while (testCase-- > 0)
            {
                // System.err.println("tc#" + testCase);
                final String[] input = stdin.readLine().split(" ");
                int num = Integer.parseInt(input[0]);
                Integer[] values = new Integer[num];

                for (int i = 3; i < input.length; ++i)
                    values[i - 3] = Integer.parseInt(input[i]);

                Data data = new Data(num, Integer.parseInt(input[1]), Integer.parseInt(input[2]), values);

                inpVal.add(data);

            }

            return inpVal;
        }
        catch (IOException e)
        {
            e.printStackTrace();
        }

        return null;
    }

    private static int getMaxWOSurprise(int a)
    {
        if (a % 3 == 0)
            return a / 3;
        else
            return (a / 3) + 1;
    }

    private static int getMaxWithSurprise(int a)
    {
        if (a == 0)
            return -1;
        else if ((a % 3) == 0)
            return (a / 3) + 1;
        else if (a % 3 == 1)
            return -1;
        else
            return (a / 3) + 2;
    }

    private static Integer[] sort(Integer[] arr)
    {
        for (int i = 0; i < arr.length - 1; ++i)
            for (int j = i + 1; j < arr.length; ++j)
                if (arr[i] < arr[j])
                {
                    int temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
        return arr;
    }

    public static void main(String[] args)
    {
        CodeJam2 cj = new CodeJam2();
        List<Data> inp = cj.getInputValue();
        // System.err.println(inp);

        // System.err.println(getMaxWithSurprise(15));

        int count = 1;

        // operating for each tc
        for (Data data : inp)
        {
            int surprise = data.getSurprise();
            int threshold = data.getThreshold();
            int answer = 0;

            Integer[] scores = sort(data.getValues());

            for (Integer score : scores)
            {
                // System.err.println(score + " " + getMaxWithSurprise(score) +
                // " " + getMaxWOSurprise(score));

                if (getMaxWOSurprise(score) >= threshold)
                    answer++;
                else if (surprise > 0 && getMaxWithSurprise(score) >= threshold)
                {
                    answer++;
                    surprise--;
                }
            }

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

        // System.err.println(cj.generateCombination(24, 40));
    }
}
