package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

/*
 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);
        }
    }
}