import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
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);
      }
   }
}
