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.util.*;
import java.io.*;
import static java.lang.Math.*;

public class B {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("C:/Users/Farnoosh/Desktop/B-small.in"));
		FileWriter fw = new FileWriter("C:/Users/Farnoosh/Desktop/B-small.out");
		/*BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
		FileWriter fw = new FileWriter("B-large.out");*/
		
		int N = 0;
		int S = 0;
		int P = 0;
		int num1 = 0;
		
		int Num = new Integer(in.readLine());
		for (int cases = 1; cases <= Num; cases++) 
		{	
			int count = 0;
			String[] ss = in.readLine().split(" ");
			N = Integer.parseInt(ss[0]);
			S = Integer.parseInt(ss[1]);
			P = Integer.parseInt(ss[2]);
			
			for(int i = 0 ; i < N ; i++){
				num1 = Integer.parseInt(ss[i+3]);
				
				if (P == 0 && num1 == 0){
					count++;
					continue;
				}
				if (num1 < Math.abs(P+2*(P-2)))
				{
					continue;
				}
				else if(num1 >= (P+2*(P-1)))
				{
					count++;
				}
				else {
					if (S > 0){
						count++;
						S--;
					}
				}// end of else
			}// end of for		 
			fw.write ("Case #" + cases + ": " + count + "\n");
		}
		fw.flush();
		fw.close();
	}

}