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.util.Scanner;

public class BDancingWithGooglers {
    public static void main(String[] ags)  {
      //System.setIn(new FileInputStream("src/com/afarok/google/codejam2012/qualificationround/B-large.in"));
      //System.setOut(new PrintStream(new File("src/com/afarok/google/codejam2012/qualificationround/B-large.out")));
        Scanner stdIn = new Scanner(System.in);
        int t = stdIn.nextInt();
        for(int tCase=1;tCase<=t;++tCase) {
            int n = stdIn.nextInt();
            int ns = stdIn.nextInt();
            int p = stdIn.nextInt();
            
            int y =0;
            for(int i=0;i<n;++i) {
                int nextTotal = stdIn.nextInt();
                int d = nextTotal/3;
                int r = nextTotal%3;
                
                if(nextTotal<p) continue;
                
                if(d>=p) {
                    ++ y;
                    continue;
                }
                
                if(p-d>2) continue;
                
                if(p-d==1) {
                    if(r>0) {
                        ++y;
                        continue;
                    } else {
                        if(ns>0) {
                            ++y;
                            --ns;
                            continue;
                        }
                    }
                } else {
                    if(ns>0 && r==2) {
                        ++y;
                        --ns;
                        continue;
                    }
                }
                
                
            }
            System.out.println("Case #"+tCase+": "+y);
        }
    }
}
