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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancingwiththegooglers;

import java.util.*;
import java.io.*;
/**
 * Google Code Jam 2012
 * Problem B. Dancing With the Googlers
 * @author STEVEN GANTENG
 * step.v4n@gmail.com
 */
public class DancingWithTheGooglers {
    
    public static int cases;
    public static String result="";
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        try {
            FileInputStream fin = new FileInputStream("B-small-attempt5.in");
            FileOutputStream fout = new FileOutputStream("B-small-attempt5.out");
            Scanner source = new Scanner(fin);
            cases = source.nextInt();
            Double t[] = new Double[100];
            int count=0;
            int a=1;
            for (int j=0;j<cases;j++)
            {
                
                int N = source.nextInt();
                int S = source.nextInt();
                double p = source.nextDouble();//System.out.println(p)
                Double tmp[] = new Double[3];                
                for (int i=0;i<N;i++)
                {
                    t[i]=source.nextDouble();
                    //System.out.print(t[i]+" ");
                    tmp[i] = t[i]/3;                                                                 
                }
                for (int k=0;k<N;k++)
                {                    
                    if (tmp[k]>=p)
                    {
                        count++;
                    }
                    else if (tmp[k]==0)
                    {
                        if (p>0)
                        {
                            
                        }
                    }
                    else if ((tmp[k]-p)>-0.7)
                    {
                        count++;
                    }
                    else if ((tmp[k]-p)>-1.34)
                    {
                        if (S==0)
                        {
                            
                        }
                        else if (S!=0)
                        {
                            count++;
                            S-=1;
                        }
                    }
                        
                    //System.out.print(tmp[k]+" ");
                }
                System.out.println();                
                result += "Case #"+a+": "+count+"\n";    
                a++;
                fout.write(result.getBytes());
                result="";
                count=0;
                System.out.println();                
                
            }
        } catch (IOException e)
        {
            
        }
        //System.out.print(0/3);
    }
}
