import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Writer;
import java.util.Scanner;

public class Main {

  public static void main (String[] args) throws IOException {
    Writer writer = new FileWriter("/home/a/dev/codejam-2012/B-submit.txt");
    Scanner scanner = new Scanner(new File("/home/a/dev/codejam-2012/A-dev.txt"));
    int n_cases = scanner.nextInt();
    scanner.nextLine();
    for (int i = 0; i < n_cases; ++i) {
      int N = scanner.nextInt();
      int S = scanner.nextInt();
      int p = scanner.nextInt();
      int [] scores = new int[N];
      for (int j = 0; j < scores.length; ++j) {
        scores[j] = scanner.nextInt();
      }
      Main main = new Main();
      writer.write("Case #" + (i + 1) + ": " + main.solve(S, p, scores) + "\n");
    }
    writer.close();
  }
  
  public int solve (int S, int p, int [] scores) {
    int count = 0;
    for (int score : scores) {
      int mod = score % 3;
      int max;
      if (mod == 0) {
        max = score / 3;
        if (max >= p) {
          ++count; continue;
        }
        if (score < 3) {
          continue;
        }
        if (max < p - 1) {
          continue;
        }
        if (S > 0) {
          --S; ++count; continue;
        }
      } else if (mod == 1) {
        max = (score - 1) / 3 + 1;
        if (max >= p) {
          ++count; continue;
        }
        continue;
      } else if (mod == 2) {
        max = (score - 2) / 3 + 1;
        if (max >= p) {
          ++count; continue;
        }
        if (max < p - 1) {
          continue;
        }
        if (S > 0) {
          --S; ++count; continue;
        }
      }
    }
    return count;
  }

}
