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.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Main {

    
    public static void main(String[] args) {
try{
        int no, i, valuemax, surprise, p, n, j, temp;
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
       no = Integer.parseInt(br.readLine());
        for (i = 0; i < no; i++) {
            int answer = 0;
            String str=br.readLine();
            StringTokenizer tok=new StringTokenizer(str," ");
            n = Integer.parseInt(tok.nextToken());
            surprise = Integer.parseInt(tok.nextToken());
            p = Integer.parseInt(tok.nextToken());
            for (j = 0; j < n; j++) {
                temp = Integer.parseInt(tok.nextToken());
                if (temp == 0) {
                    if (p != 0) {
                        continue;
                    } else {
                        answer++;
                    }
                    continue;
                }
                if (temp % 3 == 0) {
                    valuemax = temp / 3;
                    if (valuemax >= p) {
                        answer++;
                    } else if ((valuemax + 1 >= p) && (surprise != 0)) {
                        answer++;
                        surprise--;
                    }

                }
                if (temp % 3 == 1) {
                    valuemax = (temp / 3) + 1;
                    if (valuemax >= p) {
                        answer++;
                    }
                }
                if (temp % 3 == 2) {
                    valuemax = (temp / 3) + 1;
                    if (valuemax >= p) {
                        answer++;
                    } else if ((valuemax + 1 >= p) && (surprise != 0)) {
                        answer++;
                        surprise--;
                    }
                }
            }
            System.out.print("Case #" + (i + 1) + ": " + answer);
            if ((i + 1) != no) {
                System.out.print("\n");
            }
        }
        }catch(Exception e){
            System.out.println(e.toString());
        }
    }
}
