import java.util.Scanner;
import java.io.*;
class dance
{
  public static void main (String[] args) throws IOException
  { 
    File    inputData = new File("B-small-attempt0.in");
	File 	outputData= new File("Boutput.txt");
    Scanner scan = new Scanner( inputData );
	PrintStream print= new PrintStream(outputData);
    
	int t;
	int n,s,p,pi;
	t= scan.nextInt();
	for(int i=1;i<=t;i++)
	{
	n=scan.nextInt();	s=scan.nextInt();	p=scan.nextInt();
	int supTrip=0, notsupTrip=0;
	
	for(int j=0;j<n;j++)
	{
		pi=scan.nextInt();
		if(pi>(3*p-3))
		notsupTrip++;
		else if((pi>=(3*p-4))&&(pi<=(3*p-3))&&(pi>p))
		supTrip++;
	}
	
	if(s<=supTrip)
	notsupTrip=notsupTrip+s;
	else if(s>supTrip)
	notsupTrip= notsupTrip+supTrip;
	print.println("Case #"+i+": "+notsupTrip);
	}
  }
}

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author sony
 */

public class DancingGooglers {
    public static void main(String[] args) throws FileNotFoundException, IOException
    {
     BufferedReader br=new BufferedReader(new FileReader(args[0]));
  
  int Testcases=Integer.parseInt(br.readLine());
    for(int i=0;i<Testcases;i++)
    {
    String[] line=br.readLine().split(" ");
    int N=Integer.parseInt(line[0]);
    int S=Integer.parseInt(line[1]);
    int p=Integer.parseInt(line[2]);
    int count=0;
    //System.out.print("N="+N+"S="+S+"p="+p+"\n");
    int indicator=0;
    for(int j=0;j<N;j++)
    {
    int reminder=Integer.parseInt(line[3+j])%3;
    int quotient=Integer.parseInt(line[3+j])/3;
    int sum=Integer.parseInt(line[3+j]);
    
    if(reminder==0)
    indicator++;
    
    if((quotient>=p)||(reminder==1&&quotient+1==p)||(reminder==2&&quotient+1==p))
        count++;
    else if(S>0&&sum>=p){
    
    if((reminder==0&&quotient+1==p)||(reminder==2&&quotient+2==p))    
    {
        S--;
        count++;
    }
        
    }
    
    
    }
    
    System.out.print("Case #"+(i+1)+": "+count+"\n");
    
    
    
    }
    
    }
    
}

