import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.util.Scanner;


public class Q2 {
	
	public static void main(String[] args) {
		
		Scanner s = new Scanner(Q2.class.getResourceAsStream("B-small-attempt1.in"));
		
		int n = s.nextInt();
		
		int nt = 1;
		while (n-- > 0) {
			
			int resp = 0;
			
			int ng = s.nextInt();
			int ex = s.nextInt();
			int nm = s.nextInt();
			
			if (nm == 0) {
				resp = ng;
				while (ng-- > 0) {
					int nota = s.nextInt();
				}	
			} else if (nm == 1) {
				while (ng-- > 0) {
					int nota = s.nextInt();
					if (nota >= 1) {
						resp++;
					}
				}	
			} else {
				while (ng-- > 0) {
					int nota = s.nextInt();
					
					if (nota >= nm * 3 - 2) {
						resp++;
					} else if (nota >= nm * 3 - 4 && ex > 0) {
						resp++;
						ex--;
					}
				}
			}
			
			System.out.println("Case #" + nt + ": " + resp);
			
			nt++;
		}
		
	}

}
