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


public class Dancing {


	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner read = new Scanner(new InputStreamReader(System.in));
		int cases = Integer.parseInt(read.next());
		int counter =1;
		while(cases>0){
			int n = Integer.parseInt(read.next());
			int s = Integer.parseInt(read.next());
			int p = Integer.parseInt(read.next());
			int bests = 0;
			int p2 =0;
			int googler;
			for(int i=0; i<n; i++){
				 googler = Integer.parseInt(read.next());
				 int x = googler/3;
				 if(googler == 1 || googler ==2 || googler == 0 ){
					 if(googler == 1 && 1>=p)
						 bests++;
					 else if(googler == 2){
						 if(1>=p)
							 bests++;
						 else if(2 >= p && p2<s){
							 bests++;
							 p2++;
						 }
					 }else if( googler == 0 && 0>=p)
						 bests++;
				 }else{
					 if((x*3) == googler){
						 if(x>=p)
							 bests++;
						 else if((x+1)>= p && p2<s){
							 bests++;
							 p2++;
						 }
						 
					 }else if((x+x+x+1)== googler){
						 if((x+1) >= p )
							 bests++;
					 }else if((x+x+x+2) == googler){
						 if((x+1)>=p)
							 bests++;
						 else if((x+2)>=p && p2<s){
							 bests++;
							 p2++;
						 }
					 }
				 }
			}
			System.out.println("Case #"+counter+": "+bests);
			cases--;
			counter++;
		}
		

	}

}
