import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.util.*;

public class DancingWithTheGooglers {
   public static void main(String[] args) {
      Scanner scan = new Scanner(System.in);
      int numCases, currentCase, numGooglers, surprisingScores, searchFor, answer, currentScore;
      ArrayList<Integer> scores;

      numCases = scan.nextInt();
      currentCase = 0;
      while (currentCase < numCases) {
         currentCase++;
         numGooglers = scan.nextInt();
         surprisingScores = scan.nextInt();
         searchFor = scan.nextInt();
         scores = new ArrayList<Integer>();
         for (int i = 0; i < numGooglers; i++)
            scores.add(scan.nextInt());
         answer = 0;
         for (int i = 0; i < scores.size(); i++) {
            currentScore = scores.get(i);
            currentScore = currentScore / 3;
            if (scores.get(i) == 0 && searchFor != 0) {
            } else if (currentScore > searchFor) {
               answer++;
            } else if (currentScore * 3 == scores.get(i)) {
               if (currentScore == searchFor) {
                  answer++;
               } else if (surprisingScores > 0 && (currentScore + 1 == searchFor || currentScore - 1 == searchFor)) {
                  answer++;
                  surprisingScores--;
               }
            } else if ((currentScore * 3) + 1 == scores.get(i)) {
               if (currentScore == searchFor || currentScore + 1 == searchFor) {
                  answer++;
               } else if (surprisingScores > 0 && (currentScore - 1 == searchFor)) {
                  answer++;
                  surprisingScores--;
               }
            } else if ((currentScore * 3) + 2 == scores.get(i)) {
               if (currentScore == searchFor || currentScore + 1 == searchFor) {
                  answer++;
               } else if (surprisingScores > 0 && (currentScore + 2 == searchFor)) {
                  answer++;
                  surprisingScores--;
               }
            }
         }
         System.out.printf("Case #%d: %d\n", currentCase, answer);
      }
   }
}
