import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;


public class Dancers {
	public static void main (String args[]){
		if (args.length != 1){
			System.out.println ("Gimme the right arguments!");
			return;
		}
		File f = new File(args[0]);
		int testcases, surprise, p, n;
		ArrayList <Integer> scores = new ArrayList <Integer>();




		try{
			BufferedReader in = new BufferedReader (new FileReader(f));
			String s;
			testcases = Integer.parseInt(in.readLine());
			for (int i = 1; i<=testcases; i++){

				scores.clear();
				s = in.readLine();
				String temp [] = s.split(" ");
				n= Integer.parseInt (temp[0]);
				surprise = Integer.parseInt(temp[1]);
				p = Integer.parseInt(temp[2]);
				for (int j =3; j<temp.length; j++){
					scores.add(Integer.parseInt(temp[j]));
				}
				int count = 0;
				int countSpecial =0;
				for (int a : scores){
					boolean sp = true;
					boolean found = false;
					for (int q = p; q<=10; q++){
						int t = a - q;
						if(t >=0){
							int l = t/2;
							int h = t - l;
							if (Math.abs(q - l) <=2 && Math.abs(q - h) <=2){
								//	System.out.println(a + " " + + q + " " + t + " " + l + " " + h) ;
								if (Math.abs(q - l) <2 && (Math.abs(q - h) <2)){
									sp = false;	
									//		System.out.println("reg");
								}
								found = true;

							}
						}
					}

					if (found){
						count ++;
						if (sp){
							countSpecial++;
							//	System.out.println("hi");
						}
					}
				}
				//System.out.println(count + " " + countSpecial);
				if (countSpecial > surprise){
					count -= (countSpecial - surprise);
				}
				System.out.printf ("Case #%d: %d\n", i, count );
			}




		}

		catch (IOException e){

		}
	}

}
