package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;

/**
 *
 * @author Sylphid
 */
public class ProbB {

    public static void main(String[] args) throws IOException {
        FileWriter fw = new FileWriter("output");
        PrintWriter out = new PrintWriter(fw);
        File inp = new File("input");
        Scanner sc = new Scanner(inp);
        
        int tests = Integer.parseInt(sc.nextLine());
        for (int z = 0; z < tests; z++) {
            StringTokenizer strtok = new StringTokenizer(sc.nextLine(), " ");
            int n = Integer.parseInt(strtok.nextToken());
            int s = Integer.parseInt(strtok.nextToken());
            int p = Integer.parseInt(strtok.nextToken());

            List<Integer> ggl = new ArrayList<>(n);
            List<Integer> ggl_sprd = new ArrayList<>(n);
            for (int i = 0; i < n; i++) {
                int newP = Integer.parseInt(strtok.nextToken());
                if (surprised(newP) && (highP(newP) <= 10)) {
                    ggl_sprd.add(newP);
                } else {
                    ggl.add(newP);
                }
            }
            Collections.sort(ggl_sprd);
            int maxG = 0;
            for (int i = 0; i < ggl.size(); i++) {
                if (highP(ggl.get(i)) >= p) {
                    maxG++;
                }
            }
            int sCount = s;
            int indx = ggl_sprd.size();
            for (int i = 0; i < ggl_sprd.size(); i++) {
                if (sCount == 0) {
                    indx = i;
                    break;
                }
                if (highP(ggl_sprd.get(i)) >= p) {
                    maxG++;
                    sCount--;
                }
            }
            if (sCount == 0) {
                for (int i = indx; i < ggl_sprd.size(); i++) {
                    if (highP_woS(ggl_sprd.get(i)) >= p) {
                        maxG++;
                    }
                }
            }
            out.println("Case #" + (z+1) + ": " + maxG);
        }
        sc.close();
        out.close();
    }

    static boolean surprised(int total) {
        if (total % 3 == 2 || total % 3 == 0) {
            return true;
        }
        return false;
    }

    static int highP(int total) {
        if (total == 0) {
            return 0;
        }
        int highestP = 0;
        if (total % 3 == 0) {
            highestP = (int) (total / 3) + 1;
        } else {
            highestP = (int) (total / 3) + (total % 3);
        }
        if (highestP > 10) {
            highestP = 10;
        }
        return highestP;
    }

    static int highP_woS(int total) {
        int highestP = (int) (total / 3);
        if (total % 3 != 0) {
            highestP++;
        }
        return highestP;
    }
}
