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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class ProblemB {
 public static void main(String[] args) throws Exception {
  BufferedReader br = new BufferedReader(new FileReader(new File("B-small-attempt4.in")));
  PrintWriter pw = new PrintWriter(new File("B-small-attempt4.out"));
  int n, s,p, count,   temp;
  int t= new Integer(br.readLine());
  for(int c=1; c<=t; c++)
  {
   pw.append("Case #"+c+": ");
   StringTokenizer st = new StringTokenizer(br.readLine());
   n = new Integer(st.nextToken());
   s= new Integer(st.nextToken());
   p = new Integer(st.nextToken());
   count=0;
   if(p==0)
	   count=n;
   else
	for(int i=0; i< n ; i++)
   {
	temp= new Integer(st.nextToken());
	if(temp< p )
		continue;
	
    temp = (temp-p)/2;
    
    if(temp >=p-1)
    	count++;
    else if (temp>=p-2 && s>0 && p>1)
    	{
    		count++;
    		s--;
    	}
   }
   pw.append(count+"");
   pw.append('\n');
  }
  pw.flush();
  pw.close();
  br.close();
 }
}
