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 Main
{

  public static void main(String[] args)
  {
    Scanner in = new Scanner(System.in);
    Integer numCases = Integer.parseInt(in.nextLine());
    
    for (int i = 0; i < numCases; i++)
    {
      int num = in.nextInt();
	  int[] dancers = new int[num];
	  int surp = in.nextInt();
	  int p = in.nextInt();
	  
	  int count = 0;
	  
	  for (int k = 0; k < num; k++)
		dancers[k] = in.nextInt();
	  
	  for (int k = 0; k < num; k++)
	  {
		if (dancers[k] != 0)
		{
			int score = 0;
			if (dancers[k]/3 >= p)
				count++;
			else
			{
				score = (dancers[k]-p)/2;
				if (!(p-score > 2 || score-p > 2)) //Necessary?
				{
					if (p-score == 2 || score-p == 2)
					{
						if (surp != 0)
						{
							surp--;
							count++;
						}
					}
					else count++;
				}
			}
		}
		else
		{
			if (p == 0 && dancers[k] == 0)
				count++;
		}
	  }
	  
      System.out.println("Case #"+(i+1)+": "+count);
    }
  }

}