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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

public class B {
	static int surprise=0;
	static int[] findMin(int[] a)
	{
		for(int i=0;i<a.length-1;i++)
			for(int j=i+1;j<a.length;j++)
			if(a[i]>a[j])
			{
				int t=a[i];
				a[i]=a[j];
				a[j]=t;
			}
		
		return a;
				
	}
	
	static boolean checkTriplet(int a, int b, int c, int maxScore)
	{
		if(Math.abs(a-b)>2 || Math.abs(a-c)>2 || Math.abs(b-c)>2)
			return false;
		if(Math.abs(a-b)==2 || Math.abs(a-c)==2 || Math.abs(b-c)==2)
			if((a>=maxScore || b>=maxScore || c>=maxScore) && surprise>0)
			{
				surprise--;
				return true;
			}
			else return false;
		if(a>=maxScore || b>=maxScore || c>=maxScore)
			return true;
		return false;
		
		
	}
	public static void main(String args[]) throws FileNotFoundException
	{
		Scanner sin=new Scanner(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\B-small-attempt1.in"));
		PrintStream ps=new PrintStream(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\BOut.out"));
		int cases=sin.nextInt();
		for(int i=1;i<=cases;i++)
		{
			int num=sin.nextInt();
			surprise=sin.nextInt();
			int maxScore=sin.nextInt();
			int count=0;
			int[] scores=new int[num];
			for(int j=0;j<num;j++)
				scores[j]=sin.nextInt();
			
			scores=findMin(scores);
			
			for(int j=0;j<scores.length;j++)
			{
				//System.out.println(" for "+scores[j]);
				if(maxScore>scores[j])
					continue;
				int div=scores[j]/3;
				int rem=scores[j]-div;
				if(rem<maxScore)
					continue;
				if(checkTriplet(div,rem/2,rem-rem/2, maxScore))
				{
					//System.out.println("check pass for "+div+" "+rem/2+" "+(rem-rem/2));
					count++;
				}
				else if(checkTriplet(div,maxScore,rem-maxScore,maxScore))
				{
					count++;
				}
			}
			
			ps.println("Case #"+i+": "+count);
			
		}
		ps.close();
	}

}
