/**
 * 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.*;
import java.io.*;

public class P2
{
    public static void main(String[] args) throws Exception
    {
        Scanner sc = new Scanner(new FileReader("B-small-attempt0.in"));
        PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
        
        int cases = Integer.parseInt(sc.nextLine());
        int c = 0, temp = 0, us = 0;
        
        for (int i = 0; i < cases; i++)
        {
            int n = sc.nextInt(); // no. of googlers
            int s = sc.nextInt(); // no. of surprising
            int p = sc.nextInt(); // criterion
            us = 0; // used suprises
            c = 0; // googlers that pass the test
            
            for(int j = 0; j<n; j++)
            {
                temp = sc.nextInt();
                double q = (temp+0.0)/(3.0);
                // total = 4 (1 1 2) 1.33
                int t1 = ((int)Math.floor(q+(2.0/3.0)));
                int t2 = ((int)Math.floor(q+(4.0/3.0)));
                if(temp < p)
                {
                    continue;
                }
                else if(q >= p || t1 >= p)
                {
                    c++;
                    continue;
                }
                // total = 5 (1 1 3) 1.66  
                else if(us != s && t2 >= p)
                {
                    c++;
                    us++;
                    continue;
                }
            }
            
            pw.println("Case #" + (i + 1) + ": " + c);
        }
        
        pw.close();
        sc.close();
    }
}

// ((temp+1)/n)+ 1 >= p
// ((temp+1)/n) >= p
// q+1 >= p