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

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

package google_code_jam;


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

/**
 *
 * @author lenovo
 */
public class B {


    public static void main(String[] args) throws IOException {
        // TODO code application logic here

        BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
        PrintWriter pw = new PrintWriter("B.out" );
        StringTokenizer st=new StringTokenizer(br.readLine());
       // System.out.println(st);
        int x = Integer.parseInt(st.nextToken());
        a1:for (int i = 0; i < x; i++) {
           st = new StringTokenizer(br.readLine());
           int n = Integer.parseInt(st.nextToken());// number of players
           int s = Integer.parseInt(st.nextToken());//number of surprising
           int p = Integer.parseInt(st.nextToken());// best degree required
           int count=0;//
           for (int j = 0; j < n; j++) {
               int temp=Integer.parseInt(st.nextToken());
               int rem=temp%3;
               int div=temp/3;
               if(temp==0 && p!=0)continue;
               else if(temp==0 && p==0){
                   count++;
                   continue;
               }
               if(rem==0){
                   if(div>=p){
                       count++;
                       continue;
                   }
                 else if(div+1>=p && s>0){
                      count++;
                      s--;
                      continue;
                }
               }// end of this condition
               else{
                   if(rem==1){
                    if(div+1 >=p)count++;
                   }
         else if(rem==2){
        if(div+1 >= p)count++;
        else if (div+2  >=p && s>0){
            count++;
            s--;
            continue;
        }
          }
               }
            }// End of converting
           pw.append("Case #"+(i+1)+": "+count+"\n");
      }
        pw.close();
    }

}

