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

package ch.socaciu.andrei.codejam;

import java.io.*;
import java.util.ArrayList;
import java.util.List;

/**
 * @author Andrei Socaciu
 */
public class Dancing {

    public static void main(String[] args) throws Exception {
        String in = "data/Dancing-large.in.txt";
        String out = "data/Dancing-large.out.txt";
        String line = null;
        BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream(in)));
        List<String> lines = new ArrayList<String>();
        while ((line = reader.readLine()) != null) {
            lines.add(line);
        }
        reader.close();
        int tests = Integer.parseInt(lines.get(0));
        List<String> res = new ArrayList<String>();
        int k = 1;
        for (int i = 1; i <= tests; i++) {
            line = lines.get(k++);
            String[] parts = line.split(" ");
            int n = Integer.parseInt(parts[0]);
            int[] scores = new int[n];
            int s = Integer.parseInt(parts[1]);
            int p = Integer.parseInt(parts[2]);
            for (int j = 0; j < n; j++) {
                scores[j] = Integer.parseInt(parts[3+j]);
            }
            int result = solve(scores, s, p);
            res.add("Case #" + i + ": " + result);
        }
        BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(out)));
        for (String re : res) {
            writer.write(re);
            writer.write("\n");
        }
        writer.close();
    }

    private static int solve(int[] scores, int s, int p) {
        int count = 0;
        int special = s;
        for (int score : scores) {
            if (score / 3 >= p) {
                //avg. larger than p, at least one score will be >= p
                count++;
            } else if (score == 3*p - 1 || score == 3*p - 2) {
                //these are covered by the not-special cases
                count++;
            } else if (special > 0) {
                //try to see if a special case matches
                if (score % 3 == 0) { //s-1,s,s+1
                    if (score / 3 + 1 >= p && score / 3 - 1 >= 0)  {
                        count++;
                        special--;
                    }
                } else if (score % 3 == 1) {//s,s,s-2
                    if ((score + 2) / 3 >= p) {
                        count++;
                        special--;
                    }
                } else {//s,s,s+2
                    if ((score - 2) / 3 + 2 >= p) {
                        count++;
                        special--;
                    }
                }
            }
        }
        return count;
    }

}
