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.util.Scanner;


public class dance {
	public static void main(String... args){
		Scanner in = new Scanner(System.in);
		
		int cases = in.nextInt();
		int[] counts = new int[cases];
		for(int i = 0;i<cases;i++){
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int sUsed = 0; // special cases used
			
			int[] nums = new int[n];
			int[][] scores = new int[n][3];
			for(int k=0;k<n;k++){
				nums[k] = in.nextInt();
				int mod = nums[k] % 3;
				int div = nums[k] /3;
				if (mod == 2 && sUsed < s && div + 2 == p){
					scores[k][0] = div + 2;
					scores[k][1] = div;
					scores[k][2] = div;
					sUsed +=1;
				} else if(mod == 0 && div + 1 == p && sUsed <s && div > 0){
					scores[k][0] = div+ 1;
					scores[k][1] = div;
					scores[k][2] = div-1;
					sUsed += 1;
				}else if (mod == 2){
					scores[k][0] = div + 1;
					scores[k][1] = div + 1;
					scores[k][2] = div;
				} else {
					scores[k][0] = div + mod;
					scores[k][1] = div;
					scores[k][2] = div;
				}
			}
			//count 
			int count = 0;
			for(int k = 0;k<n;k++){
				if(scores[k][0] >= p){
					count++;
				}
			}
			counts[i] = count;
			
		}
		for(int i = 0;i<cases;i++){
			System.out.printf("Case #%d: %d\n",i+1,counts[i]);
		}
		
	}
}
