package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

public class Googler {
	private int totalScore;
	private int[] scores;
	private boolean isWeird;	// scores of the judge

	public Googler(int totalScore) {
		scores = new int[3];
		this.totalScore = totalScore;
		isWeird = false;
		setMins();
	}

	private void setMins() {
		int copyTotal = this.totalScore;
		int i = 0;	// start at first index
		if (copyTotal == 0) {
			this.scores[0] = 0;
			this.scores[1] = 0;
			this.scores[2] = 0;
		}
		while (copyTotal > 0) {
			this.scores[i] = this.scores[i] + 1;	// index 0 will have highest score
			i = (i + 1) % 3;
			copyTotal--;
		}
	}

	public boolean hasHighScore(int p) {
		int i;
		for (i = 0; i < 3; i++) {
			if (this.scores[i] >= p) {
				return true;
			}
		}
		return false;
	}
	private boolean canBeWeird() {
		if (this.totalScore <= 1 || this.totalScore > 27 || this.totalScore % 3 == 1) {
			return false;
		}
		return true;
	}
	public boolean weirdHighScore(int p) {
		if (canBeWeird() && this.scores[0] + 1 >= p) {
			this.isWeird = true;
			this.scores[0] = this.scores[0] + 1;
			this.scores[1] = this.scores[1] - 1;
			return true;
		} else {
			return false;
		}
	}
	@Override
	public String toString() {
		String s = this.isWeird ? "W" : "";
		s = s + "[" + this.scores[0] + "," + this.scores[1] + "," + this.scores[2] + "] tot=" + this.totalScore;
		return s;
	}
}
