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

package round0.p2;

import java.io.File;
import java.util.Scanner;

public class Main
{  
  public static void main(final String[] args) throws Exception
  {
    Scanner s = new Scanner(new File("D:\\unsorted\\b.in"));
    int T = s.nextInt();
    
    for (int i = 0; i < T; i++)
    {
      int N = s.nextInt();
      int S = s.nextInt();
      int p = s.nextInt();
      int[] t = new int[N];
      for (int j = 0; j < N; j++)
        t[j] = s.nextInt();
      
      int successes = 0;
      for (int j = 0; j < N; j++)
      {
        if (t[j] >= Math.max(p*3-2, p))
          successes++;
        else if (t[j] >= Math.max(p*3-4, p) && S > 0)
        {
          successes++;
          S--;
        }
      }
      
      System.out.println("Case #"+(i+1)+": "+successes);
    }
  }
}