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.io.*;
import java.util.*;

public class GoogleQual2012B
{   public static void main(String[] args) throws Throwable
    {   new GoogleQual2012B();
    }
    
    public GoogleQual2012B() throws Throwable
    {   Scanner in = new Scanner(new File("B-large.in"));
        PrintWriter out = new PrintWriter(new FileWriter("B-large.out"));
        int numTests = in.nextInt();
        for (int i = 0; i < numTests; i++)
        {   int numGoogs = in.nextInt();
            int numSuprsLeft = in.nextInt();
            int threshhold = in.nextInt();
            int total = 0;
            for (int j = 0; j < numGoogs; j++)
            {   int currTriple = in.nextInt();
                if (maxScore(currTriple) >= threshhold)
                {   total++;
                }
                else if (numSuprsLeft > 0 && maxScoreWithSurp(currTriple) >= threshhold)
                {   total++;
                    numSuprsLeft--;
                }
            }
            out.println("Case #" + (i + 1) + ": " + total);
        }
        out.close();
    }
    
    int maxScore(int total)
    {   if (total % 3 == 0)
        {   return total / 3;
        }
        return (total / 3) + 1;
    }
    
    int maxScoreWithSurp(int total)
    {   if (total == 0)
        {   return 0;
        }
        if (total % 3 == 2)
        {   return (total / 3) + 2;
        }
        return (total / 3) + 1;
    }
}