/**
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingWithTheGooglers {
    public static void main(String[] args) throws IOException {
        printMaxPossibleHighScorers(new BufferedReader(new FileReader("B-small-attempt2.in")), new BufferedWriter(new FileWriter("out.txt")));
    }
    
    public static void printMaxPossibleHighScorers(BufferedReader in, BufferedWriter out) throws IOException {
        String line = in.readLine(); // we don't need to read num test cases
        int caseNum = 1;
        
        while ((line = in.readLine()) != null && line.length() != 0 ) {
            String result = "Case #" + caseNum + ": ";
            
            String[] lineDetails = line.split(" ");
            int n = Integer.parseInt(lineDetails[0]);   // googlers
            int s = Integer.parseInt(lineDetails[1]);   // surprises
            int p = Integer.parseInt(lineDetails[2]);   // high score
            int[] googlers = new int[lineDetails.length-3];
            
            for (int j = 3; j < lineDetails.length; j++) {
                googlers[j-3] = Integer.parseInt(lineDetails[j]);
            }
            
            int maxPossibleHighScorers = 0;
            int possibleHighScorers = 0;
            int surprisesLeft = s;
            for (int j = 0; j < n; j++) {
                int score = googlers[j];
                int base = score / 3;
                int offset = score % 3;
                int maxScore = -1;
                if (base > 0) {
                	maxScore = (offset == 0 ? base : base + 1);
                    if ((p - maxScore == 1) && offset != 1 && surprisesLeft > 0) {
                        maxScore++;
                        surprisesLeft--;
                    }
                } else {
                	maxScore = (score == 0 ? 0 : 1);
                    if ((p - maxScore == 1) && offset == 2 && surprisesLeft > 0) {
                        maxScore++;
                        surprisesLeft--;
                    }
                }
                 
                if (maxScore >= p) {
                    possibleHighScorers++;
                }
            }
            if (possibleHighScorers > maxPossibleHighScorers) {
                maxPossibleHighScorers = possibleHighScorers;
            }
            result += maxPossibleHighScorers;
            
            out.write(result);
            out.newLine();
            caseNum++;
        }
        in.close();
        out.close();
    }
}
