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.*;
import java.io.*;

public class dancing {
    public static void main(String[] args) throws Throwable {
	Scanner input=new Scanner(new File("dancing.in"));
	PrintWriter out=new PrintWriter(new File("dancing.out"));
	int cases=input.nextInt();
	for(int test=1;test<=cases;test++) {
	    int n=input.nextInt();
	    int s=input.nextInt();
	    int p=input.nextInt();
	    int[] t=new int[n];
	    for(int i=0;i<n;i++) t[i]=input.nextInt();
	    int numNS=0, numS=0;
	    for(int i=0;i<n;i++) {
		if(t[i]/3+(t[i]%3==0?0:1)>=p) numNS++;
		}
	    for(int i=0;i<n;i++) {
		if(t[i]<2) {
		    if(t[i]>=p) numS++;
		    }
		else {
		    if((t[i]-2)/3+2>=p) numS++;
		    }
		}
	    int ans=numNS+Math.min(numS-numNS, s);
	    out.println("Case #"+test+": "+ans);
	    }
	out.close();
	}
    }