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

public class Second2
{
	public static void main(String[]args)throws Exception
	{
		BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
		PrintWriter pw = new PrintWriter(new File("B-large.out"));
		StringTokenizer st;
		int cases = Integer.parseInt(br.readLine());
		for(int c = 0; c < cases; c++)
		{
			st = new StringTokenizer(br.readLine());
			int n = Integer.parseInt(st.nextToken());
			int [] totals = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for(int i = 0; i < n; i++)
				totals[i] = Integer.parseInt(st.nextToken());
			Arrays.sort(totals);
			int res = 0;
				
			for(int i = 0; i < n; i++)
			{
				outer:for(int j = p; j <= totals[i]; j++)
				{
					for(int k = j-2; k <= j; k++)
					{
						if(k < 0)
							continue;
						for(int l = j-2; l <= j; l++)
						{
							if(l < 0)
								continue;
							if(j+k+l > totals[i])
								break outer;
							if(j+k+l == totals[i])
							{
								if(j-k == 2 || j-l == 2)
								{
									
									if(s > 0)
										s--;
									else
										continue;
								}
								res++;
								break outer;
							}
						}
					}
				}
			}
			pw.printf("Case #%d: %d\n", c+1, res);
		}
		pw.close();
		pw.flush();
		/*
		for(int i = 0; i < totals.length; i++)
		{
			for(int j = 0; j <= s; j++)
				System.out.println(dp[i][j]);
		}*/
		//System.out.println(dp[totals.length-1][s]);
	}
}