/**
 * 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.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

class Dancing {

    public static void main(String args[]) throws IOException {
        Scanner in = new Scanner(new File("dance.txt"));
        PrintWriter fw = new PrintWriter(new FileWriter(new File("dance.out")));
        int cases = in.nextInt();
        for (int c = 1; c <= cases; c++) {
            int N = in.nextInt(); // number of googlers
            int S = in.nextInt(); // number of surprising triplets
            int p = in.nextInt(); // best result
            ArrayList<Integer> scores = new ArrayList<Integer>();
            for (int n = 0; n < N; n++) {
                int googler = in.nextInt();
                scores.add(googler);
            }
            Collections.sort(scores);
            int pass = 0;
            for (int i = 0; i < scores.size(); i++) {
                int score = scores.get(i);
                int mod = score % 3;
                int max = score / 3;
                int low = max;
                if (mod > 0) {
                    max++;
                }
                if (max >= p) {
                    pass++;
                    continue;
                }
                if (S > 0) {
                    if (mod % 2 == 0) {
                        if(mod == 0 && low == 0){
                            continue;
                        }
                        max++;
                        if (max >= p) {
                            pass++;
                            S--;
                            continue;
                        }
                    }
                }

            }// for loop
            String fwout = "Case #" + c + ": " + pass;
            fw.println(fwout);
        }
        fw.close();
    }
}
