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

class b
{
	public static void main(String [] args)
	{
	 	Scanner in = new Scanner(System.in);
	 	int T = in.nextInt();
	 	for(int t=1;t<=T;++t)
	 	{
	 		int N = in.nextInt();
	 		int S = in.nextInt();
	 		int p = in.nextInt();
	 		int max = 0;
	 		int trips [] = new int[N];
	 		for(int i=0;i<N;++i)
	 		{
	 			trips[i] = in.nextInt();
	 			int div3 = trips[i] / 3;
	 			int diff = trips[i] - div3*3;
	 			if(diff == 0)
	 			{
	 				if(div3 >= p)
	 				{
	 					max++;
	 				}
	 				else
	 				{
	 					if(S > 0 && div3+1 >= p && div3-1 >= 0)
	 					{
	 						max++;
	 						S--;
	 					}
	 				}
	 			}
	 			else if(diff == 1)
	 			{
	 				//Still need to allocate 1 more
	 				if(div3 >= p)
	 				{
	 					++max;
	 				}
	 				else if(div3+1 >= p)
	 				{
	 					++max;
	 				}
	 			}
	 			else if(diff == 2)
	 			{
	 				//Still need to allocate 2 more
	 				if(div3 >= p)
	 				{
	 					max++;
	 				}
	 				else
	 				{
	 					if(div3+1 >= p)
	 					{
	 						max++;
	 					}
	 					else if(S > 0 && div3+2 >= p)
	 					{
	 						max++;
	 						S--;
	 					}
	 				}
	 			}
	 		}
	 		System.out.println("Case #"+t+": " + max);
	 	}
	}
}
