import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}


/**
 * Write a description of class solver here.
 * 
 * @author (your name) 
 * @version (a version number or a date)
 */
public class solver
{
   public int solve(int nog,int nos,int p,int t[])
   {
       int[] aux=new int[2*nog];
       int i=0,count=0;
       for(i=0;i<nog;i++)
       {   
               if(t[i]==0)
               {
                 aux[i]=0;
                 aux[nog+i]=-1;
                }
               else if(t[i]==1)
               {
                 aux[i]=1;
                 aux[nog+i]=-1;
                }
                
               else if(t[i]==29)
               {
                 aux[i]=10;
                 aux[nog+i]=-10;
                }
               else if(t[i]==30)
               {
                 aux[i]=10;
                 aux[nog+i]=-10;
                }
                else if(t[i]%3==0)
                {
                    aux[i]=t[i]/3;
                    aux[nog+i]=t[i]/3+1;
                }
                else if(t[i]%3==1)
                {
                    aux[i]=t[i]/3+1;
                    aux[nog+i]=-1;
                }
                else
                {
                    aux[i]=t[i]/3+1;
                    aux[nog+i]=t[i]/3+2;
                }
                
       }
       for(i=0;i<nog;i++)
       {
           if(aux[i]>=p)
           {
               count++;
               aux[nog+i]=-1;
            }
        }
        for(i=0;i<nog;i++)
        {
            if(nos==0)
            break;
            else if(aux[i+nog]>=p)
            {
                   nos-=1;
                   count++;
            }
        }
        return count;
       
    }
}