package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class B {

	static Scanner reader;
	static BufferedWriter writer;	

	static int countS;
	static int S;
	static int P;
	static int N;
	static int result;

	public static void verifiyTriple(int pi) {
		int div = pi/3;
		int mod = pi%3;
		int dif = P - pi/3;

		if (div >= P) {
			result++;
		} else if (dif <= 2){
			if (mod == 0) {
				if (countS < S && dif == 1) {
					countS++;
					result++;
				}
			}
		} else {
			if (dif==1) {
				result++;
			} else if ( mod == 2 && countS < S ) {
				countS++;
				result++;
			}
		}
	}


	public static void main(String[] args) throws IOException {
		reader = new Scanner(new FileReader("in.txt"));
		writer = new BufferedWriter(new FileWriter("out.txt"));

		int nt = reader.nextInt();
		for(int i = 1; i <= nt; i++) {
			result = 0;
			N = reader.nextInt();
			S = reader.nextInt();
			P = reader.nextInt();
			countS = 0;
			for (int j = 0; j < N; j++) {
				int pi = reader.nextInt();
				int div = pi/3;
				int mod = pi%3;
				int dif = P - div;

				if (pi < P)
					continue;

				if (div >= P) {
					result++;
				} else if (dif <= 2){
					if (mod == 0) {
						if (countS < S && dif == 1) {
							countS++;
							result++;
						}
					} else {
						if (dif==1) {
							result++;
						} else if ( mod == 2 && countS < S ) {
							countS++;
							result++;
						}
					}

				}
			}

			writer.write("Case #" + i + ": " + result);
			if (i < nt)
				writer.newLine();
		}
		writer.close();
	}

}
