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

public class QualBDancingWithTheGooglers
{
   static boolean debug = false;

   public static void main(String[] args)
   {
      Utils.openInFile("B-small-attempt0.in");
      Utils.openOutFile("out.txt", debug);
      String input = Utils.readFromFile();
      int lineCount = Integer.parseInt(input);

      //while ((input = Utils.readFromFile()) != null)
      for (int line = 1; line <= lineCount; line++)
      {
         if (debug) System.out.println();
         input = Utils.readFromFile();
         String[] split = input.split(" ");
         int Number = Integer.parseInt(split[0]),
             Surprising = Integer.parseInt(split[1]),
             points = Integer.parseInt(split[2]);
         int[] allPoints = new int[Number];
         for (int j = 0; j < Number; j++)
            allPoints[j] = Integer.parseInt(split[j+3]);
         String output = "";

         int mustBeSurprisingCount = 0, count = 0;
         
         for (int sumP: allPoints)
         {
            int mod = sumP%3;
            int third = sumP/3;
            int minP = third, maxP = third, minPSup = third, maxPSup = third;
            switch (mod)
            {
               case 0: minPSup--; maxPSup++; break;
               case 1: maxP++; minPSup--; maxPSup++; break;
               case 2:
               default:maxP++; maxPSup+=2;
            }
            if (debug) System.out.println("third="+third);
            if (points <= maxP)
               count++;
            else if (2 <= sumP && sumP <= 28 && points <= maxPSup)
               mustBeSurprisingCount++;
         }

         if (debug)
         {
            System.out.println("input="+input);
            System.out.println("count="+count);
            System.out.println("mustBeSurprisingCount="+mustBeSurprisingCount);
         }
         output = "Case #" + line + ": ";
         output += (count + Math.min(mustBeSurprisingCount, Surprising));
         Utils.writeToFile(output);
      }
      Utils.closeInFile();
      Utils.closeOutFile();
   }
}
