/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}


import java.util.Arrays;
import java.util.Scanner;

public class B {

    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int i = 0; i < t; i++) {
            int n = in.nextInt();
            int s = in.nextInt();
            int p = in.nextInt();
            int ans = 0;

            int a[] = new int[n];
            int b[] = new int[n];
            for (int j = 0; j < n; j++) {
                a[j] = in.nextInt();
                if (a[j] % 3 == 0) {
                    b[j] = a[j] / 3;
                } else if ((a[j] > 0) && (a[j] - 1) % 3 == 0) {
                    b[j] = (a[j] - 1) / 3 + 1;
                } else if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                    b[j] = (a[j] - 2) / 3 + 1;
                }
            }
            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] < p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x >= p) {
                        ans++;
                        a[j] = -1;
                        s--;
                    }
                }
            }
            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] < p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x != -1) {
                        a[j] = -1;
                        s--;
                    }
                }
            }
            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] >= p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x >= p) {
                        ans++;
                        a[j] = -1;
                        s--;
                    }
                }
            }

            for (int j = 0; j < n && s > 0; j++) {
                if (a[j] >= 0 && b[j] >= p) {
                    int x = -1;
                    if ((a[j] > 1) && (a[j] - 2) % 3 == 0) {
                        x = (a[j] - 2) / 3 + 2;
                    } else if ((a[j] > 2) && (a[j] - 3) % 3 == 0) {
                        x = (a[j] - 3) / 3 + 2;
                    } else if ((a[j] > 3) && (a[j] - 4) % 3 == 0) {
                        x = (a[j] - 4) / 3 + 2;
                    }
                    if (x != -1) {
                        ans--;
                        a[j] = -1;
                        s--;
                    }
                }
            }
            for (int j = 0; j < n; j++) {
                if (a[j] >= 0 && b[j] >= p) {
                    ans++;
                }
            }
            System.out.println("Case #"+(i+1)+": "+ans);
        }
    }
}
