import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


import java.util.*;

class b
{
	public static void main(String [] args)
	{
	 	Scanner in = new Scanner(System.in);
	 	int T = in.nextInt();
	 	for(int t=1;t<=T;++t)
	 	{
	 		int N = in.nextInt();
	 		int S = in.nextInt();
	 		int p = in.nextInt();
	 		int max = 0;
	 		int trips [] = new int[N];
	 		for(int i=0;i<N;++i)
	 		{
	 			trips[i] = in.nextInt();
	 			int div3 = trips[i] / 3;
	 			int diff = trips[i] - div3*3;
	 			if(diff == 0)
	 			{
	 				if(div3 >= p)
	 				{
	 					max++;
	 				}
	 				else
	 				{
	 					if(S > 0 && div3+1 >= p && div3+1 <= 10 && div3-1 >= 0)
	 					{
	 						max++;
	 						S--;
	 					}
	 				}
	 			}
	 			else if(diff == 1)
	 			{
	 				//Still need to allocate 1 more
	 				if(div3 >= p)
	 				{
	 					++max;
	 				}
	 				else if(div3+1 >= p && div3+1 <= 10)
	 				{
	 					++max;
	 				}
	 			}
	 			else if(diff == 2)
	 			{
	 				//Still need to allocate 2 more
	 				if(div3 >= p)
	 				{
	 					max++;
	 				}
	 				else
	 				{
	 					if(div3+1 >= p && div3+1 <= 10)
	 					{
	 						max++;
	 					}
	 					else if(S > 0 && div3+2 >= p && div3+2 <= 10)
	 					{
	 						max++;
	 						S--;
	 					}
	 				}
	 			}
	 		}
	 		System.out.println("Case #"+t+": " + max);
	 	}
	}
}
