import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.io.*;
import java.util.*;

class GoogleDance
{
	public static void main(String[] args)
	{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		Scanner sc=new Scanner(new InputStreamReader(System.in));
		int t=sc.nextInt();
		String ans[]=new String[t];
		for(int i=0;i<t;i++)
		{
			int n,s,p,b=0;
			n=sc.nextInt();
			s=sc.nextInt();
			p=sc.nextInt();
			
			for(int j=0;j<n;j++)
			{
				int tot=sc.nextInt();
				int quo,rem;
				quo=tot/3;
				rem=tot%3;
				if(rem==0)
				{
					if(quo>=p)
					{
						b++;
						continue;
					}
					else if((quo+1)==p)
					{
						if(s>0)
						{
							if((quo-1)>0)
							{
								s--;
								b++;
								continue;
							}
						}
					}
				}
				else if(rem==1)
				{
					if((quo+1)>=p)
					{
						b++;
						continue;
					}
				}
				else if(rem==2)
				{
					if((quo+1)>=p)
					{
						b++;
						continue;
					}
					else if((quo+2)>=p)
					{
						if(s>0)
						{
							s--;
							b++;
							continue;
						}
					}
				}
			}
			ans[i]="Case #"+(i+1)+": "+b;
		}
		for(int i=0;i<t;i++)
			System.out.println(ans[i]);
	}
}
