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 ProblemB {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File(args[0]));
		int numberOfLines = Integer.parseInt(sc.nextLine());
		Scanner lineScan;
		int numberOfPeople =0, numberOfSurprising = 0, bestRes = 0;
		ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
		ArrayList<Integer> triple;
		
		int score, count = 0;
		String line = " ";
		
		for (int i=0; i<numberOfLines;i++)
		{
			count = 0;
			line = sc.nextLine();
			lineScan = new Scanner(line);
			numberOfPeople = lineScan.nextInt();
			numberOfSurprising = lineScan.nextInt();
			bestRes = lineScan.nextInt();
			
			for (int j = 0; j< numberOfPeople; j++)
			{
				score = lineScan.nextInt();
				triple = new ArrayList<Integer>();
				if (score % 3 == 0)
				{
					
					if (score/3 < bestRes && score/3 + 1 >= bestRes && score > 0 && numberOfSurprising > 0)
					{
						triple.add(score/3 -1);
						triple.add(score/3);
						triple.add(score/3 +1);
						numberOfSurprising --;
					}
					else
					{
						for (int k = 0; k<3; k++)
							triple.add(score/3);
					}
					list.add(triple);
				}
				else
				{
					double mean = (double) score /3;
					double boundary = score/3 +0.5;
					if (mean > boundary )
					{
						if (score/3 + 2 == bestRes && numberOfSurprising >0)
						{
							triple.add(score/3);
							triple.add(score/3);
							triple.add(score/3 +2);
							numberOfSurprising--;
						}
						else
						{
							triple.add(score/3);
							triple.add(score/3 +1);
							triple.add(score/3 + 1);
						}
							
					}
					else
					{
						triple.add(score/3);
						triple.add(score/3);
						triple.add(score/3 +1);
					}
					
					list.add(triple);
						
					
				}
			}
			
			//System.out.println("Line " + line);
			for (ArrayList<Integer> tri: list)
			{
				if (tri.get(tri.size()-1) >= bestRes)
					count++;
				
			}

			System.out.printf("Case #%d: %d\n", i+1, count);
			
			list.clear();
							
		}
	}

}
