import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}


//Author KNIGHT0X300 

import java.util.Scanner;




public class Main {
    
    public static void main(String[] args) {
       Scanner s=new Scanner(System.in);
       int t=s.nextInt();
      
       for(int i=0;i<t;i++)
       {  int tot=0;
           int N=s.nextInt();
           int S=s.nextInt();
           int p=s.nextInt();
   int A=0;     
           for(int j=0;j<N;j++)
           {
               
               A=s.nextInt();
            //  System.out.print(" "+A);
      if(p>=2)
      {    if(S>0)
       {  if((A==(3*p-4))||(A==(3*p-3)))
       {    tot++; S--;              }
       }
       if(A>=3*p-2)
           tot++;
           }
       if(p==0)
       {
       tot++;
       }
       if(p==1)
       {  
       if(A>=1)
       {//System.out.println("sdk");
           tot++;}
       }}
           
           
           
        System.out.println("Case #"+(i+1)+": "+tot);
                      
          
       }
        
    }
}
