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.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;


public class DancingWithGooglers {

	public static void main(String[] args) throws FileNotFoundException {
		int cases;
		
		Scanner scan = new Scanner(new File("B.small.in"));
		cases = scan.nextInt();
		
		for (int i = 1; i <= cases; i++) {
			int googlers = scan.nextInt();
			int surprising = scan.nextInt();
			int p = scan.nextInt();
			int totals[] = new int[googlers];
			
			for (int j = 0; j < googlers; j++) {
				totals[j] = scan.nextInt();
			}
			
			int isSurprising = 0;
			int possible = 0;
			
			for (int j = 0; j < googlers; j++) {
				if (p - (totals[j] / 3) <= 0) {
					possible++;
				} else if (p - (totals[j] / 3) == 1) { /* avg = 5, p = 6 */
					if (totals[j] % 3 == 0 && totals[j] > 0) {
						possible++; /* 0 */
						isSurprising++;
					} else if (totals[j] % 3 == 1) {
						possible++;
					} else if (totals[j] % 3 == 2) {
						possible++;
					}
				} else if (p - (totals[j] / 3) == 2) {
					if (totals[j] % 3 == 0) {
						
					} else if (totals[j] % 3 == 1) {
						
					} else if (totals[j] % 3 == 2) {
						possible++;
						isSurprising++;
					}
				}
			}
			
			if (isSurprising > surprising) {
				possible -= isSurprising - surprising;
			}
			
			System.out.println("Case #" + i + ": " + possible);
		}
	}

}
