package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.StringTokenizer;


public class B {

  void main2(String[] args) throws Exception {
    BufferedReader br = new BufferedReader(new FileReader(args[0]));
    String line = br.readLine();
    int count = Integer.parseInt(line);
    for (int i = 0; i < count; i++) {
      line = br.readLine();

      // 3 1 5 15 13 11
      StringTokenizer st = new StringTokenizer(line, " ", false);
      int n = Integer.parseInt(st.nextToken());
      int s = Integer.parseInt(st.nextToken());
      int p = Integer.parseInt(st.nextToken());

      int[] t = new int[n];
      for (int j = 0; j < n; j++) {
        t[j] = Integer.parseInt(st.nextToken());
      }

      System.out.println("Case #" + (i + 1) + ": " + max(n, s, p, t));
    }
    br.close();
  }


  private int max(int n, int s, int p, int[] t) {
    int max = 0;

    for (int i = 0; i < n; i++) {

      int r = t[i] % 3;
      int k = t[i] / 3;
      int b = 0;
      int bs = 0;
      switch (r) {
      case 0:
        b = k;
        bs = t[i] == 0 ? 0 : k + 1;
        break;
      case 1:
        b = k + 1;
        bs = t[i] == 1 ? -1 : k + 1;
        break;
      case 2:
        b = k + 1;
        bs = k + 2;
      }

      if (b >= p) {
        max++;
      } else if (bs >= p && s > 0) {
        max++;
        s--;
      }

    }
    return max;
  }



  public static void main(String[] args) throws Exception {
    new B().main2(args);
  }
}
