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

public class GoogleQual2012B
{   public static void main(String[] args) throws Throwable
    {   new GoogleQual2012B();
    }
    
    public GoogleQual2012B() throws Throwable
    {   Scanner in = new Scanner(new File("B-small-attempt2.in"));
        PrintWriter out = new PrintWriter(new FileWriter("B-small-attempt2.out"));
        int numTests = in.nextInt();
        for (int i = 0; i < numTests; i++)
        {   int numGoogs = in.nextInt();
            int numSuprsLeft = in.nextInt();
            int threshhold = in.nextInt();
            int total = 0;
            for (int j = 0; j < numGoogs; j++)
            {   int currTriple = in.nextInt();
                if (maxScore(currTriple) >= threshhold)
                {   total++;
                }
                else if (numSuprsLeft > 0 && maxScoreWithSurp(currTriple) >= threshhold)
                {   total++;
                    numSuprsLeft--;
                }
            }
            out.println("Case #" + (i + 1) + ": " + total);
        }
        out.close();
    }
    
    int maxScore(int total)
    {   if (total % 3 == 0)
        {   return total / 3;
        }
        return (total / 3) + 1;
    }
    
    int maxScoreWithSurp(int total)
    {   if (total == 0)
        {   return 0;
        }
        if (total % 3 == 2)
        {   return (total / 3) + 2;
        }
        return (total / 3) + 1;
    }
}