import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

/*
 a = y    b = n    c = f    d = i    e = c    f = w    g = l    h = b    i = k    j = u    k = o     l = m     m = x    n = s    o = e
 p = v    q = z    r = p    s = d    t = r    u = j    v = g    w = t    x = h    y = a    z = q
*/
import java.util.*;
public class Dancing  {
    
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        sc.nextLine();
        
        for (int i = 0; i < T; i++)
        {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();
            
            int AWESOME = p + 2*(p-1);
            int SURP_GOOD = p + 2*(p-2);
            
            System.out.print("Case #" + (i + 1) + ": ");
            
            int goodOnes = 0;
            int[] curr = new int[N];
            for (int j = 0; j < N; j++)
            {
                curr[j] = sc.nextInt();
            }
            Arrays.sort(curr);
            for (int j = N-1; j >= 0; j--)
            {
                if (p == 0)
                    goodOnes++;
                else if (curr[j] >= AWESOME && curr[j] > 0)
                    goodOnes++;
                else if (curr[j] > 0 && S > 0 && curr[j] >= SURP_GOOD)
                {
                    goodOnes++;
                    S--;
                }
            }
            System.out.println(goodOnes);
        }
    }
}