/**
 * 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.*;
import java.lang.Math.*;
public class gcj2
{
     public static void main(String args[])throws Exception
     {
         //Scanner in=new Scanner(System.in);
         //BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
         //BufferedReader br = new BufferedReader(new FileReader("gcj2.in"));
         //PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("gcj2.out")));
         //PrintWriter pw = new PrintWriter(System.out);
         BufferedReader br = new BufferedReader(new FileReader("C:\\Users\\rahul\\Desktop\\gcj2.in"));
         PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("C:\\Users\\rahul\\Desktop\\gcj2.out")));
         StringTokenizer st;
         int a[]={0,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10,10,10};
         int c[]={-1,-1,2,5,8,11,14,17,20,23,26};
         int t=Integer.parseInt(br.readLine());
         int ctr=0;
         while(t>0)
         {
             t--;
             ctr++;
             int need=0,best=0;
             st=new StringTokenizer(br.readLine());
             int n=Integer.parseInt(st.nextToken());
             int s=Integer.parseInt(st.nextToken());
             int p=Integer.parseInt(st.nextToken());
             
             for(int i=0;i<n;i++)
             {
                 int val=Integer.parseInt(st.nextToken());
                 if(a[val]>=p)
                 {
                     if(p>=2 && (val==c[p] || val==c[p]+1))
                     {
                        need++;
                      }
                      
                      else best++;
                  }
             }
             best=best + Math.min(s,need);
             pw.println("Case #" + ctr + ": " +best);
         }

        pw.flush();
        pw.close();
     }
}