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

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Formatter;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author Bart
 */
public class Qual_B {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        try {
            String file = "B-small-attempt0";
            Scanner scanner = new Scanner(new FileInputStream(file + ".in"));
            Formatter formatter = new Formatter(new File(file + ".out"));

            int numberOfCases = scanner.nextInt();
            System.out.println("Number of cases: " + numberOfCases);

            for (int caseNr = 0; caseNr < numberOfCases; caseNr++) {
                // ** Code Here ** //
                int n = scanner.nextInt();
                int nSpecialCases = scanner.nextInt();
                int max =scanner.nextInt();
                int[] numbers = new int[n];
                System.out.println("n: " + n);
                for(int i=0;i<n;i++){
                    numbers[i] = scanner.nextInt();
                }
                int minAccepted = max + (max-1)*2;
                int maxAccepted = max*3;
                int minSpecial = max + (max-2)*2;
                if (minSpecial <= 0)
                    minSpecial = 1;
                System.out.printf("[%d, %d] (%d)%n", minAccepted, maxAccepted, minSpecial);
                
                int score=0;
                for(int i: numbers){
                    if(i>=minAccepted){
                        System.out.println("Binnen grens: " + i);
                        score++;
                    }
                    else if(nSpecialCases >0 && i>=minSpecial){
                        System.out.println("Binnen grens(speciaal)");
                        score++;
                        nSpecialCases--;
                    }
                }
                
                System.out.println("Score: " + score);
                
                formatter.format("Case #%d: %d%n", caseNr + 1, score);
            }
            formatter.close();
        } catch (FileNotFoundException ex) {
            Logger.getLogger(Qual_B.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
}
