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.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfMain {

	public static void main(String[] args) throws FileNotFoundException {
		String file = "B-small-attempt0";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for(int t=1; t<=T; t++){
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			
			int[] scores = new int[N];
			int[] bst = new int[N];
			int[] dmax = new int[N];
			
			int nextp=0;
			int prevp=0;
			for(int i=0; i < scores.length; i++){
				int s = scores[i] = in.nextInt();
				if(s%3==0){
					bst[i]=s/3;
					dmax[i] = bst[i]>0?1:0;
				}else if(s%3 ==1){
					bst[i]=s/3 + 1;
					dmax[i] = 0;
				}else{
					bst[i]=s/3 + 1;
					dmax[i] = 1;
				}
				
				if(bst[i]>=p)
					nextp++;
				if(bst[i]==p-1&& dmax[i]>0)
					prevp++;
			}			
			out.println("Case #" + t + ": "+(nextp+Math.min(S, prevp)));//+Math.min(S, prevp));			
		}
		
		
		in.close();
		out.close();
	}
}
