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


public class caseHandler {

	int N;
	int S;
	int P;
	
	int bestNum;
	
	int[] scores;
	
	public caseHandler(int N, int S, int P, int[] scores){
		this.N = N;
		this.S = S;
		this.P = P;
		this.scores = scores;
		this.bestNum = 0;
	}
	
	public int solveCase(){
		loopCase(scores[0], 0, 0, 0);
		return bestNum;
	}
	
	private void loopCase(int score, int currN, int Scount, int pNumCount){
		int currSCount = Scount;
		int currpNumCount = pNumCount;
		
		int aproxMinScore = score/3 - 1;
		if (aproxMinScore < 0) aproxMinScore = 0;
		for(int i=aproxMinScore;i<=10;i++){
			for(int j=aproxMinScore;j<=10;j++){
				if(Math.abs(i-j)>2) continue;
				for(int k=aproxMinScore;k<=10;k++){
					int min = Math.min(Math.min(i, j), k);
					if(Math.abs(min-i)>2 || Math.abs(min-j)>2 || Math.abs(min-k)>2) continue;
					if(i+j+k == score){
						int s = 0;
						int p = 0;
						if(Math.abs(i-j)==2 || Math.abs(k-j)==2 || Math.abs(k-i)==2) s = 1;
						if(currSCount+s > S) continue;
							else{
							if(i>=P || j>=P || k>=P) p = 1;
							
							if(currN == N-1){
								if(currpNumCount+p > bestNum) bestNum=currpNumCount+p;
							}
							else loopCase(scores[currN+1], currN+1, currSCount+s, currpNumCount+p);
						}
					}
				}
			}
		}
	}
}
