import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}


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