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.io.*;
   import java.util.*;
   public class dancing
   {
      public static void main(String[] args) throws Exception
      {
         BufferedReader reader = new BufferedReader(new FileReader("B-small-attempt0.in"));
         PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-small.out")));
         int cases = Integer.parseInt(reader.readLine());
         for(int x = 0; x < cases; x++)
         {
            int count = 0;
            String next = reader.readLine();
            StringTokenizer token = new StringTokenizer(next);
            int N = Integer.parseInt(token.nextToken()); 
            int S = Integer.parseInt(token.nextToken());
            int p = Integer.parseInt(token.nextToken());
            int[] array = new int[N];
            for(int y = 0; y < N; y++)
               array[y] = Integer.parseInt(token.nextToken());
            for(int y = 0; y < N; y++)
            {
               if(array[y] == 0 && p != 0){
               }
               else if(array[y] >= 28)
               {
                  if(p <= 10)
                     count++;
               }
               else if(array[y]%3 == 1)
               {
                  if(array[y]/3 + 1 >= p)
                     count++;
               }
               else if(array[y]%3 == 2)
               {
                  if(array[y]/3 + 1 >= p)
                     count++;
                  else if(array[y]/3 + 2 >= p)
                     if(S > 0)
                     {
                        S--;
                        count++;
                     }
               }
               else if(array[y]%3 == 0)
                  if(array[y]/3 >= p)
                     count++;
                  else if(array[y]/3 + 1 >= p)
                     if(S > 0)
                     {
                        S--;
                        count++;
                     }
            }
            out.println("Case #" + (x + 1) + ": " + count);
         }
         out.close();
      }
   }