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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.LinkedList;
import java.util.Scanner;

public class DancingWiththeGooglers {

	public static void main(String[] args) throws FileNotFoundException {
		 Scanner in = new Scanner(new File("B-large.in"));
//		Scanner in = new Scanner(System.in);
		BufferedWriter out = null;
		try {
			FileWriter fstream = new FileWriter("out.txt");
			out = new BufferedWriter(fstream);
			int cases = in.nextInt();
			int N;
			int S;
			int P;
			LinkedList<Integer> googlers;
			for (int i = 0; i < (cases); i++) {
				int result = 0;
				int surprising = 0;
				int canBe = 0;
				N = in.nextInt();
				S = in.nextInt();
				P = in.nextInt();
				googlers = new LinkedList<Integer>();
				for (int j = 0; j < N; j++) {
					int t = in.nextInt();
					// if (t != 0)
					googlers.add(t);
				}
				for (int j = 0; j < googlers.size(); j++) {
					int temp = googlers.get(j) - (3 * P);
					if (temp == -3 || temp == -4) {
						if (googlers.get(j) != 0) {
							surprising++;
						}
					} else if (temp >= -2) {
						result++;
						if (googlers.get(j) != 29 || googlers.get(j) != 30) {
							canBe++;
						}
					}
				}
				int answer = 0;
				int tempo = 0;
				if (S <= surprising) {
					tempo = S;
				} else {
					tempo = surprising;
					// if(tempo<=canBe)
					// answer=result;
					// tempo = Math.abs(tempo - canBe);
				}
//				System.out.println(result + " " + tempo);
				answer = result + tempo;
				out.write("Case #" + (i + 1) + ": " + answer + "\n");
				System.out.println("Case #" + (i + 1) + ": " + answer);
			}
			out.close();
		} catch (Exception e) {// Catch exception if any
		}

	}
}
