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 static java.lang.System.*;

class B{

    static public void main(String[] args){
	Scanner sc = new Scanner(System.in);
	int cases = Integer.parseInt(sc.nextLine());
	for(int c = 1; c<=cases; c++){
	    String[] s = sc.nextLine().split(" ");
	    int n = Integer.parseInt(s[0]);
	    int sur = Integer.parseInt(s[1]);
	    int p = Integer.parseInt(s[2]);
	    int[] score = new int[n];
	    int cz = 0;
	    for(int i = 0; i<n; i++){
		score[i] = Integer.parseInt(s[3+i]);
		if(score[i] == 0)
		    cz ++;
	    }
	    if(p == 1){
		out.println("Case #"+c+": "+(n-cz));
		continue;
	    }
	    if(p == 0){
		out.println("Case #"+c+": "+(n));
		continue;
	    }
	    int cnt = 0;
	    int pot = 0;
	    for(int i:score){
		if(i <= 1) continue;
		int nsur = (i-1)/3+1;
		if(nsur >=p)
		    cnt++;
		else{
		    if(nsur == (p-1)){
			if(i%3 != 1)
			    pot++;
		    }
		}
	    }
	    cnt += Math.min(pot, sur);	
	    out.println("Case #"+c+": "+cnt);
	}
    }

}