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 DataModel extends Thread {
		
		private int googlersNo;
		private int suprScore;
		private int minScore;
		private int[] googScore;
		private int caseNo;
		private int output;
		private boolean stateCalc;
		
		public DataModel(String input, int caseNo) {
			this.caseNo = caseNo;
			String[] temp = input.split(" ");
			stateCalc = false;
			try {
				googlersNo = Integer.parseInt(temp[0]);
				suprScore = Integer.parseInt(temp[1]);
				minScore = Integer.parseInt(temp[2]);
				googScore = new int[googlersNo];
				for(int i = 0;i<googlersNo;i++) {
					googScore[i] = Integer.parseInt(temp[3+i]);
				}
			} catch (Exception e) {
				e.printStackTrace();
				System.exit(1);
			}
		}
		
		private boolean isOverReqScore(int i) {
			int[] temp = {i/3,i/3,i/3};
			int diff = (i-(temp[0]+temp[1]+temp[2]));
			int minDiff = minScore-temp[0];
			if(diff > 0) {
				temp[0] += 1;
				if(diff > 1 && minDiff < 3 && minDiff > 0 && suprScore > 0) {
					temp[0] += 1;
					suprScore--;
				} else if(diff > 1) {
					temp[1] += 1;
				} 
			} else if (minDiff == 1 && temp[0]!=0 && suprScore > 0) {
				temp[0] += 1;
				temp[2] -= 1;
				suprScore--;
			}
			return (temp[0]>=minScore||temp[1]>=minScore||temp[2]>=minScore);
		}
		
		@Override
		public void run() {
			for(int i = 0;i<googlersNo;i++) {
				if(isOverReqScore(googScore[i])) {
					output++;
				}
			}
			stateCalc = true;
		}
		
		public boolean isDone() { 
			return stateCalc;
		}
		
		public void getOutput() {
			System.out.println("Case #"+caseNo+": "+output);
		}
	}