/**
 * 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();
    }
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package google.code.jam.dancing.with.the.googlers;

import java.util.ArrayList;

/**
 *
 * @author Lucas
 */
public class BestResultFinder {

    public ArrayList<Integer> findBestResult(ArrayList<ArrayList> list) {

        ArrayList<Integer> result = new ArrayList<Integer>();
        ArrayList<Integer> current;
        int total;
        int surprising;
        int min;
        int value;

        for (int n = 0; n < list.size(); n++) {

            current = list.get(n);
            total = 0;
            surprising = current.get(1);
            min = current.get(2);

            for (int m = 0; m < current.get(0); m++) {

                value = current.get(3 + m) / 3;

                switch (current.get(3 + m) % 3) {

                    // (n, n, n) -> Regular
                    // (n - 1, n , n + 1) -> Surprising

                    case 0: {

                        if (value >= min) {
                            total++;
                        } else if ((surprising > 0) && (value > 0) && (value + 1 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                        
                    // (n, n, n + 1) -> Regular
                    // (n - 1, n + 1, n + 1) -> Surprising
                            
                    case 1: {
                        if ((value >= min) || (value + 1 >= min)) {
                            total++;
                        } else if ((surprising > 0) && (value + 1 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                        
                    // (n, n + 1, n + 1) -> Regular
                    // (n, n, n + 2) -> Surprising
                        
                    case 2: {
                        if ((value >= min) || (value + 1 >= min)) {
                            total++;
                        } else if ((surprising > 0) && (value + 2 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                }
            }
            result.add(total);
        }
        return result;
    }
}
