import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(new FileReader("B-large.in"));
        PrintWriter out = new PrintWriter(new FileWriter("DancingWithTheGooglers-Large.out"));

        DancingWithTheGooglers solver = new DancingWithTheGooglers();
        int testCases = in.nextInt();
        for (int i = 1; i <= testCases; ++i) {
            solver.solve(i, in, out);
        }

        in.close();
        out.close();
    }
}

class DancingWithTheGooglers {
    int MAX_SCORE = 31;
    int[] bestScoreSurprising = new int[MAX_SCORE];
    int[] bestScoreNotSurprising = new int[MAX_SCORE];

    public DancingWithTheGooglers() {
        Arrays.fill(bestScoreSurprising, -1);
        Arrays.fill(bestScoreNotSurprising, -1);
        for (int i = 0; i <= 10; ++i) {
            for (int j = 0; j <= 10; ++j) {
                for (int k = 0; k <= 10; ++k) {
                    if (Math.abs(i - j) > 2 || Math.abs(j - k) > 2 || Math.abs(k - i) > 2) continue;
                    if (Math.abs(i - j) == 2 || Math.abs(j - k) == 2 || Math.abs(k - i) == 2) {
                        int sum = i + j + k;
                        int score = Math.max(i, Math.max(j, k));
                        bestScoreSurprising[sum] = Math.max(bestScoreSurprising[sum], score);
                    }
                    else {
                        int sum = i + j + k;
                        int score = Math.max(i, Math.max(j, k));
                        bestScoreNotSurprising[sum] = Math.max(bestScoreNotSurprising[sum], score);
                    }
                }
            }
        }
    }

    public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int S = in.nextInt();
        int P = in.nextInt();
        int[] t = new int[N];
        for (int i = 0; i < N; ++i)
            t[i] = in.nextInt();

        int res = 0;
        int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, z = 0;
        for (int score : t) {
            if (bestScoreSurprising[score] == -1) {
                if (bestScoreNotSurprising[score] >= P) {
                    ++a;
                }
                else {
                    ++c;
                }
            }
            else if (bestScoreNotSurprising[score] == -1) {
                if (bestScoreSurprising[score] >= P) {
                    ++b;
                }
                else {
                    ++d;
                }
            }

            if (bestScoreSurprising[score] >= P) {
                if (bestScoreNotSurprising[score] >= P) {
                    ++h;
                }
                else {
                    ++f;
                }
            }
            else if (0 <= bestScoreSurprising[score] && bestScoreSurprising[score] < P) {
                if (bestScoreNotSurprising[score] >= P) {
                    ++g;
                }
                else {
                    ++e;
                }
            }
        }

        z = Math.min(S, b + d);
        S -= z;
        res += a + b;
        z = Math.min(S, f);
        S -= z;
        res += z;
        z = Math.min(S, e + h);
        S -= z;
        res += g + h - S;

        out.println("Case #" + testNumber + ": " + res);
    }
}
