/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

// library In.java at http://introcs.cs.princeton.edu/stdlib/stdlib.jar

public class PB {
    public static void main (String[] args) {
        int t, n, s, p;
        
        int num, mod, quot;
        int maybe;
        int counter;
        int max;
        
        In in = new In("input.txt");
        t = Integer.parseInt(in.readLine());
        
        int i = 1;
        // get input
        while (in.hasNextLine()) {
            maybe = 0;
            counter = 0;
            n = in.readInt();
            s = in.readInt();
            p = in.readInt();
            
            for (int j = 0; j < n; j++) {
                num = in.readInt();
                quot = num / 3;
                mod = num % 3;

                if (mod == 1) {
                    if (quot + 1 >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 2 <= num) {
                        maybe++;
                        continue;
                    }
                }
                if (mod == 0){ 
                    if (quot >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 3 <= num && num != 0) {
                        maybe++;
                        continue;
                    }
                }
                if (mod == 2) {
                    if (quot + 1 >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 4 <= num) {
                        maybe++;
                        continue;
                    }
                }
            }
            max = Math.min(s, maybe);
            
            System.out.print("Case #" + i + ": " + (max + counter) + "\n");
            i++;
        }
    }
}
