package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;

public class DancingWithTheGooglers {

    public static int max(int N, int S, int p, int[] T) {
        int max = 0;
        for (int i = 0; i < T.length; i++) {
            int a = T[i] / 3;
            if (T[i] == 0) {
                if (0 >= p)
                    max++;
            }
            else if (T[i] == 1) {
                if (1 >= p)
                    max++;
            }
            else if (T[i] == 2) {
                if (1 >= p)
                    max++;
                else if (2 >= p && S > 0) {
                    max++;
                    S--;
                }
            }
            else if (T[i] % 3 == 0) {
                if (a >= p)
                    max++;
                else if (a + 1 >= p && S > 0) {
                    max++;
                    S--;
                }
            }
            else if (T[i] % 3 == 1) {
                if (a + 1 >= p)
                    max++;                
            }
            else { // T[i] % 3 == 2
                if (a + 1 >= p)
                    max++;
                else if (a + 2 >= p && S > 0) {
                    max++;
                    S--;
                }
            }
        }
        return max;
    }

    public static void solve(String file) throws Exception {
        
        BufferedReader f = new BufferedReader(new FileReader(file + ".in"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(file + ".out")));

        int T = Integer.parseInt(f.readLine());
        for (int i = 0; i < T; i++) {
            String[] s = f.readLine().split(" ");
            int N = Integer.parseInt(s[0]);
            int S = Integer.parseInt(s[1]);
            int p = Integer.parseInt(s[2]);
            int[] totals = new int[N];
            for (int j = 0; j < N; j++)
                totals[j] = Integer.parseInt(s[j + 3]);
            int max = max(N, S, p, totals);
            System.out.println("Case #" + (i+1) +": " + max);
            out.println("Case #" + (i+1) +": " + max);
        }
        out.close();
    }
    
    public static void main(String[] args) throws Exception {
        
        //String file = "B-test";
        String file = "B-small-attempt1";
        
        solve(file);
    }
}
