/**
 * 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;

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

/**
 *
 * @author alvin
 */
public class DancingWithTheGooglers implements Comparable<DancingWithTheGooglers> {
    
    public int a, b, c;
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int nTC = sc.nextInt();
        for (int tc = 1; tc <= nTC; tc++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            
            DancingWithTheGooglers skor[] = new DancingWithTheGooglers[n];
            for (int i = 0; i < n; i++) {
                skor[i] = new DancingWithTheGooglers(sc.nextInt());
            }
            
            Arrays.sort(skor);
            
            int hasil = 0;
            for (int i = 0; i < n; i++) {
                if (skor[i].a >= p || skor[i].b >= p || skor[i].c >= p) {
                    ++hasil;
                } else if (s > 0) {
                    if ((skor[i].a == skor[i].b) && (skor[i].a + 1 >= p) && (skor[i].b - 1 >= 0)) {
                        ++hasil;
                        --s;
                    } else if ((skor[i].b == skor[i].c) && (skor[i].b + 1 >= p) && (skor[i].c - 1 >= 0)) {
                        ++hasil;
                        --s;
                    }
                }
            }
            
            System.out.format("Case #%d: %d\n", tc, hasil);
        }
    }

    public DancingWithTheGooglers(int skor) {
        a = skor / 3;
        b = skor / 3;
        c = skor / 3;
        
        int sisa = skor - (a + b + c);
        if (sisa == 1) {
            ++a;
        } else if (sisa == 2) {
            ++a; ++b;
        }
    }

    @Override
    public int compareTo(DancingWithTheGooglers o) {
        if (a != o.a) {
            return (o.a - a);
        } else if (b != o.b) {
            return (o.b - b);
        } else if (c != o.c) {
            return (o.c - c);
        } else {
            return 0;
        }
    }
    
}

