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);
		
		
		
	}
}

import java.io.*;
import java.util.*;
import java.lang.Math.*;
public class gcj2
{
     public static void main(String args[])throws Exception
     {
         //Scanner in=new Scanner(System.in);
         //BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
         //BufferedReader br = new BufferedReader(new FileReader("gcj2.in"));
         //PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("gcj2.out")));
         //PrintWriter pw = new PrintWriter(System.out);
         BufferedReader br = new BufferedReader(new FileReader("C:\\Users\\rahul\\Desktop\\gcj2.in"));
         PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("C:\\Users\\rahul\\Desktop\\gcj2.out")));
         StringTokenizer st;
         int a[]={0,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,10,10};
         int c[]={-1,-1,2,5,8,11,14,17,20,23,26};
         int t=Integer.parseInt(br.readLine());
         int ctr=0;
         while(t>0)
         {
             t--;
             ctr++;
             int need=0,best=0;
             st=new StringTokenizer(br.readLine());
             int n=Integer.parseInt(st.nextToken());
             int s=Integer.parseInt(st.nextToken());
             int p=Integer.parseInt(st.nextToken());
             
             for(int i=0;i<n;i++)
             {
                 int val=Integer.parseInt(st.nextToken());
                 if(a[val]>=p)
                 {
                     if(p>=2 && (val==c[p] || val==c[p]+1))
                     {
                        need++;
                      }
                      
                      else best++;
                  }
             }
             best=best + Math.min(s,need);
             pw.println("Case #" + ctr + ": " +best);
         }

        pw.flush();
        pw.close();
     }
}