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.util.*;
public class B {

	/**
	 * @param args
	 */
	private static boolean sup(int i,int j,int k) {
		return (Math.abs(i-j)==2 || Math.abs(i-k)==2 || Math.abs(j-k)==2);
	}
	
	private static boolean[] analyze(int x, int p) {
		int i,j,k;
		boolean ret[] = new boolean[4];
		for (i=0;i<=10;i++) {
			for (j=0;j<=10;j++) {
				if (Math.abs(i-j)<=2) {
					k = x-i-j;
					if (k>=0 && k<=10 && Math.abs(k-i)<=2 && Math.abs(k-j)<=2) {
						if (i>=p || j>=p || k>=p) {
							if (sup(i,j,k)) {
								ret[0] = true;
							} else {
								ret[1] = true;
							}
						} else if (sup(i,j,k)) {
							ret[2] = true;
						} else {
							ret[3] = true;
						}
					}
				}
			}
		}
		return ret;
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		int i,j;
		for (i=1;i<=T;i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int overp = 0;			
			int condp = 0;
			int result;
			for (j=0;j<N;j++) {
				int x = in.nextInt();
				if (x>(p-1)*3) {
					overp++;					
				} else if (x<3*p-4 || p==1) {					
				} else {
					condp++; 
				}
			}
			result = Math.min(S, condp) + overp;
			System.out.println("Case #"+i+": "+result);
		}
	}

}
