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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class DancingWiththeGooglers 
{
public static void main(String[] args) throws IOException {
	FileWriter wr=new FileWriter("Output.txt");
	BufferedWriter buff=new BufferedWriter(wr);
	
	FileReader read=new FileReader("B-large.in");
	BufferedReader buffr=new BufferedReader(read);
	
	String str;
	str=buffr.readLine();
	int n=Integer.parseInt(str);
	int j=1;
	Scanner sc;
	int googleres,s,p;
	int list[];
	int i;
	int num;
	int total=0;
	while(j<=n)
	{
		int non[]={0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10};
		
		int sup[]={-1,-1,-1,2,3,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,10,10,10,-1,-1,-1};
		
	total=0;
	str=buffr.readLine();
	sc=new Scanner(str);
	sc.useDelimiter(" ");
	googleres=sc.nextInt();
	s=sc.nextInt();
	p=sc.nextInt();
	i=1;
	list=new int[googleres];
	while(i<=googleres)
	{
	list[i-1]=sc.nextInt();
	i++;
	}
	
	if(s==0)
	{
		for(int k=1;k<=googleres;k++)
		{
			num=list[k-1];
			if(non[num]>=p)
				++total;
		}
		
	}
	else
	{
		
		for(int k=1;k<=googleres;k++)
		{
			if(s!=0)
			{
			num=list[k-1];
			if(non[num]>=p)
				++total;
			else
			{
				if(sup[num]>=p)
				{
					--s;
					++total;
				}
			}
		}
			else
			{
				num=list[k-1];
				if(non[num]>=p)
					++total;
			}
			
		}	
		
	}
		
	StringBuffer temp = new StringBuffer("Case #"+j+": ");
	temp=temp.append(Integer.toString(total));
	buff.write(temp.toString());
	buff.newLine();
	j++;
	}
buff.close();
}
}
