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

package ru.sidorkevich.google.jam.qualification.b;

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

public class Triplet {

    public static int MAX_DISTANCE = 2;

    private int score1;
    private int score2;
    private int score3;

    public Triplet(int score1, int score2, int score3) {
        this.score1 = score1;
        this.score2 = score2;
        this.score3 = score3;
    }

    public int getScore1() {
        return score1;
    }

    public int getScore2() {
        return score2;
    }

    public int getScore3() {
        return score3;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;

        Triplet triplet = (Triplet) o;

        Set<Integer> set1 = new HashSet<Integer>();
        set1.add(score1);
        set1.add(score2);
        set1.add(score3);

        Set<Integer> set2 = new HashSet<Integer>();
        set2.add(triplet.score1);
        set2.add(triplet.score2);
        set2.add(triplet.score3);

        return set1.equals(set2);
    }

    @Override
    public int hashCode() {
        int result = score1;
        result = 31 * result + score2;
        result = 31 * result + score3;
        return result;
    }

    @Override
    public String toString() {
        return score1 + " " + score2 + " " + score3;
    }

    public boolean isSurprising() {
        return Math.abs(score1 - score2) == MAX_DISTANCE || Math.abs(score1 - score3) == MAX_DISTANCE ||
                Math.abs(score2 - score3) == MAX_DISTANCE;
    }

    public int bestScore() {
        return Math.max(Math.max(score1, score2), score3);
    }
}
