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


public class B {

	
	public static void main(String[] args) throws IOException {
//		Scanner in = new Scanner(new File("in/B/test.in"));
//		Scanner in = new Scanner(new File("in/B/small.in"));
		Scanner in = new Scanner(new File("in/B/big.in"));
//		BufferedWriter bw = new BufferedWriter(new FileWriter(
//				"out/B/test.out"));
//		BufferedWriter bw = new BufferedWriter(new FileWriter(
//				"out/B/small.out"));
		BufferedWriter bw = new BufferedWriter(new FileWriter(
				"out/B/big.out"));
		int cases = in.nextInt();
		for(int c = 1; c <= cases; c++){
			int competitors = in.nextInt();
			int surprises = in.nextInt();
			int minNote = in.nextInt();
			int winners = 0;
			for(int i = 0; i < competitors; i++){
				int max = 0, normal = 0;
				int note = in.nextInt();
				System.err.println(note);
				if(note == 0){
					max = 0;
					normal = 0;
				}else if(note == 1){
					max = 1;
					normal = 1;
				}else if(note > 27){
					max = 10;
					normal = 10;
				}else{
					int mod = note%3;
					max = note/3 + (mod==0?1:mod);
					normal = max - (mod!=1?1:0);
				}
				if(normal >= minNote){
					winners++;
					continue;
				}
				if(max == minNote && surprises > 0){
					surprises--;
					winners++;
					continue;
				}
			}
			bw.write("Case #" + (c) + ": "+winners);
			System.err.println("Case #" + (c) + ": "+winners);
			bw.newLine();
		}
		in.close();
		bw.flush();
		bw.close();
	}
}
