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

/**
 * @(#)Main.java
 *
 *
 * @author 
 * @version 1.00 2012/4/14
 */
 import java.io.*;

public class Main {
	
    public static void main(String[] args)throws IOException {
        BufferedReader br = new BufferedReader(new FileReader("B-small-attempt4.in"));
        FileWriter fstream = new FileWriter("B-small-attempt4.out");
        BufferedWriter out = new BufferedWriter(fstream);
        String in = br.readLine();
        int testCases = Integer.parseInt(in);
        int i = 1;
        
        while(testCases > 0) {
        	in = br.readLine();
        	out.write("Case #" + i + ": " + solve(in.split(" ")) + "\n");
        	testCases--;
        	i++;
        }
        out.close();
    }
    
    public static int solve(String[] in) {
    	int n = Integer.parseInt(in[0]);
    	int s = Integer.parseInt(in[1]);
    	int p = Integer.parseInt(in[2]);
    	int solution = 0;
    	
    	for(int i = 3; i < in.length; i++) {
    		int t = Integer.parseInt(in[i]);
    		switch(p) {
    			case 0:solution++;break;
    			case 1:if(t >= 1) solution++;break;
    			case 2:if(s > 0 && (t >= 2 && t <= 3)){solution++; s--;}else if(t > 3)solution++;break;
    			case 3:if(s > 0 && (t >= 5 && t <= 6)){solution++; s--;}else if(t > 6)solution++;break;
    			case 4:if(s > 0 && (t >= 8 && t <= 9)){solution++; s--;}else if(t > 9)solution++;break;
    			case 5:if(s > 0 && (t >= 11 && t <= 12)){solution++; s--;}else if(t > 12)solution++;break;
    			case 6:if(s > 0 && (t >= 14 && t <= 15)){solution++; s--;}else if(t > 15)solution++;break;
    			case 7:if(s > 0 && (t >= 17 && t <= 18)){solution++; s--;}else if(t > 18)solution++;break;
    			case 8:if(s > 0 && (t >= 20 && t <= 21)){solution++; s--;}else if(t > 21)solution++;break;
    			case 9:if(s > 0 && (t >= 23 && t <= 24)){solution++; s--;}else if(t > 24)solution++;break;
    			case 10:if(s > 0 && (t >= 26 && t <= 27)){solution++; s--;}else if(t > 27)solution++;break;
    		}
    	}
    	return solution;
    }
}
