import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

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


public class Recycle {
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("output.txt"));

		String line = "";
		line = br.readLine();
		int number = Integer.valueOf(line);
		for(int i = 1; i<= number; i++){
			line = br.readLine();
			String[] tokens = line.split(" ");
			int result = 0;
			int n = Integer.valueOf(tokens[0]);
			int surprising = Integer.valueOf(tokens[1]);
			int p = Integer.valueOf(tokens[2]);
			if(p == 0){
				result = n;
			}
			else{
			for(int a = 1;a<=n;a++){
				int score = Integer.valueOf(tokens[2+a]);
				int d = score/3;
				if(score == 0)
					continue;
				if(d >=p){
					result++;
				}
				else{
					int m = score%3;
					if((m == 1||m==2) && d+1 == p)
						result++;
					else if(m == 0 && d+1 == p && surprising !=0){
						result++;
						surprising--;
					}
					if(m == 2&&	d+2 ==p &&surprising !=0){
						result++;
						surprising--;
					}
				}
			}
			}
			System.out.println(result);
			bw.append("Case #"+i+": "+result);
			bw.newLine();
		}
		br.close();
		bw.close();
	}
}
