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

import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;

/** Main function is "solve" **/
public class CodeJamProblem2 {

		static HashMap<String,String> mappings=null;
		public static void main(String args[])
		{				
			solve();
		}

		private static void solve() {
				readFromInputAndWriteInOutput();			
		}

		private static void readFromInputAndWriteInOutput() {
			try {
				File f = new File("B-small-attempt1.in");
				FileReader fileReader = new FileReader(f);
				BufferedReader buff = new BufferedReader(fileReader);
				String totalTestCases = buff.readLine();
				PrintWriter printWriter = new PrintWriter("B-small-attempt1.out");
				int testCases = Integer.parseInt(totalTestCases);
				for(int i =1;i<=testCases;i++)
				{
					
					String line =  buff.readLine();
					String outputLine = "Case #"+i+": ";
					String result = solveForThisLine(line);
					outputLine = outputLine.concat(result);			
					printWriter.println(outputLine);
					//System.out.println(outputLine);
				}
				printWriter.close();
				
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
			catch (Exception e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		
		}

		private static String solveForThisLine(String line) {
			
			String splitS[] = line.split(" ");
			int numberOfGooglers = Integer.parseInt(splitS[0]);
			int numberOfSurprisingScores = Integer.parseInt(splitS[1]);
			int reqP = Integer.parseInt(splitS[2]);
			int result = 0;
			int number=0;
			int quo = 0;
			int rem = 0;
			for(int i = 3;i<splitS.length;i++)
			{
				number =Integer.parseInt(splitS[i]);
				if(number==0 && reqP==0)
				{
					
					result=result+1;
					continue;
				}
				if(number ==0 )
					continue;
				quo = number/3;
				rem = number%3;
				rem = rem==0? 0 : 1;
				if(quo>=reqP || (rem+quo)>=reqP)
				{
					result=result+1;
					continue;
				}
				else 
				{
					if(numberOfSurprisingScores>=1)
					{
						number +=2;
						quo = number/3;
						rem = number%3;
						rem = rem==0? 0 : 1;
						if(quo>=reqP || (rem+quo)>=reqP)
						{
							result=result+1;
							numberOfSurprisingScores=numberOfSurprisingScores-1;
							continue;
						}
					
					}
						
				}
			}
			return result+"";
		}
}
