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


public class qb {

	public static void main(String [] args)
	{
		String fileName = "B-small-attempt4.in";
		
		try{
			FileReader fr = new FileReader(fileName);
			BufferedReader br = new BufferedReader(fr);
			
			FileWriter fw = new FileWriter("output.txt");
			BufferedWriter bw = new BufferedWriter(fw);
			
			String line="";
			int count = 0;
			while((line=br.readLine())!=null)
			{
				if(count == 0)
				{
					count++;					
					continue;
				}
				String [] sp = line.split(" ");
				
				int [] rule = new int[3];	//rule 3°³¸¦ Áý¾î³ÖÀ½. 1.»ç¶÷¼ö, 2.¼­ÇÁ¶óÀÌÂ¡ °¹¼ö. 3.¸Æ½ºÁ¡¼ö				
				for(int i=0; i<3; i++)
					rule[i] = Integer.parseInt(sp[i]);

				
				int [] player = new int[sp.length-3];	//³ª¸ÓÁö µÚ¿¡ °ªµéÀÌ ÇÃ·¹ÀÌ¾î Á¡¼öÀÌ¹Ç·Î ´Æ.
				int [] playerScore = new int[player.length*3];	//ÇÑ»ç¶÷´ç ¼¼¸íÀÇ ½É»çÀ§¿ø Æò°¡ Á¡¼ö
				for(int i=0; i<player.length; i++)
					player[i] = Integer.parseInt(sp[i+3]);					
				
				for(int i=0; i<player.length; i++)		//½ºÄÚ¾î ºÐ¹è
				{
					if(player[i] % 3 == 0)
					{
						for(int j=0; j<3; j++)
						{
							playerScore[i*3] = player[i]/3;
							playerScore[i*3+1] = player[i]/3;
							playerScore[i*3+2] = player[i]/3;
						}
					}
					else if(player[i] % 3 == 1)
					{
						for(int j=0; j<3; j++)
						{
							playerScore[i*3] = player[i]/3+1;
							playerScore[i*3+1] = player[i]/3;
							playerScore[i*3+2] = player[i]/3;
						}						
						
					}
					else if(player[i] % 3 == 2)
					{
						for(int j=0; j<3; j++)
						{
							playerScore[i*3] = player[i]/3+1;
							playerScore[i*3+1] = player[i]/3+1;
							playerScore[i*3+2] = player[i]/3;
						}						
					}					
				}
				
				int nPlayerOverMax = 0;	
				int nPlayerCanSup = 0;
				int solution = 0;
				for(int i=0; i<player.length; i++) //°ËÃâ½Ä
				{
					if(rule[2]*3-3 < player[i])
						nPlayerOverMax++;
					else 
					{
						if(rule[2] < player[i] )
						{
							if(player[i] % 3 == 0 || player[i] %3 == 2)
							{
								
								if((playerScore[i*3]) +1 >= rule[2])
								{
									nPlayerCanSup++;
								}
							}
							else
							{
								if((playerScore[i*3]) >= rule[2])
									nPlayerCanSup++;
							}
								
						}
					}
				}
				if(nPlayerCanSup >= rule[1])
					solution = nPlayerOverMax + rule[1];
				else
					solution = nPlayerOverMax + nPlayerCanSup;
				
				if(solution > rule[0])
					solution = rule[0];
				
				bw.write("Case #"+count+": "+solution);
				bw.write("\n");
				count++;
			}
			
			bw.close();
			fw.close();
			br.close();
			fr.close();
			
				
		}catch(Exception EE)
		{
			EE.printStackTrace();
		}
		
		
	}
	
}
