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


package codejam;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;

public class Googler
{

    public static void main(String[] args) throws Exception
    {
        BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream("/home/ankush/Downloads/B-large.in")));
        int i =1;
        int n = Integer.parseInt(reader.readLine());
        PrintWriter pw = new PrintWriter("2.out");
        for(; i<=n; i++)
        {
            String input = reader.readLine();
            pw.print("Case #" + i + ": ");
            String[] sp = input.split(" ");
            int numData  = Integer.parseInt(sp[0]);
            int s = Integer.parseInt(sp[1]);
            int p = Integer.parseInt(sp[2]);
            
            int[] data = new int[numData];
            for(int j=0; j<numData; j++)
            {
                data[j] = Integer.parseInt(sp[j+3]);
            }
            pw.println(count(data, s, p));
        }
        pw.close();
    }
    
    public static int count(int[] data, int s, int p)
    {
        Arrays.sort(data);
        int count = 0;
        for(int i=data.length-1; i>=0 && s>=0; i--)
        {
            if(data[i] % 3 == 0)
            {
                if(data[i]/3 >= p)
                {
                    count++;
                    continue;
                }
                else if(data[i]/3 + 1 >=p && s>0 && data[i]/3 -1 >=0)
                {
                    count++;
                    s--;
                    continue;
                }
                else
                {
                    break;
                }
            }
            else if(data[i] % 3 == 2)
            {
                if((data[i]/3 >= p) || data[i]/3 + 1 >=p)
                {
                    count++;
                    continue;
                }
                else if(data[i]/3 + 2 >=p && s>0)
                {
                    count++;
                    s--;
                    continue;
                }
                else
                {
                    break;
                }
            }
            else
            {
                if((data[i]/3 >= p) || data[i]/3 + 1 >=p)
                {
                    count++;
                    continue;
                }
                else if(data[i]/3 - 1 >=p && s>0 && data[i]/3 - 1>=0)
                {
                    count++;
                    s--;
                    continue;
                }
                else
                {
                    break;
                }
            }
        }
        
        return count;
    }
    
}
