package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;


public class GoogleJamQ2 {

	  static int[] triplets = new int[100];
	  static int number_googlers = 0;
	  static int number_surprising = 0;
	  static int least_number = 0;
	
	    
	  
	/**
	 * @param args
	 * @throws IOException 
	 */
	private static void get_numbers(String toCalculate)
	{
		char[] number_to_convert = new char[4];
		int number_got = 0;
		int number_triplets = 0;
		int number_length = 0;
		int str_length = toCalculate.length();
		for(int k = 0; k < str_length; k++)
		{
			number_to_convert[0] = toCalculate.charAt(k);
			number_length ++;
			if(k + 1 < str_length)
			{
				number_to_convert[1] = toCalculate.charAt(k+1);
				k++;
				if(number_to_convert[1] != ' ')
				{
					number_length ++;
					if(k + 1 < str_length)
					{
						number_to_convert[2] = toCalculate.charAt(k+1);
						k++;
						if(number_to_convert[2] != ' ')
						{
							number_length ++;
							k++;
						}
					}

				}
			}

			switch(number_got)
			{
				case 0:
					number_googlers = new Integer(new String(number_to_convert,0,number_length));
					number_got ++;
					break;
				case 1:
					number_surprising = Integer.parseInt(new String(number_to_convert,0,number_length));
					number_got ++;
					break;
				case 2:
					least_number = Integer.parseInt(new String(number_to_convert,0,number_length));
					number_got ++;
					break;
				default:
					triplets[number_triplets] = Integer.parseInt(new String(number_to_convert,0,number_length));
					number_got ++;
					number_triplets ++;
					break;
			}
			number_length = 0;
		}
	}
	
	private static boolean canGreater(int total, int least)
	{
		int single = total / 3;
		int remainer = total % 3;
		if (single >= least)
		{
			return true;
		}
		else
		{

			switch(remainer)
			{
				case 0:
					if(number_surprising > 0)
					{
						if(single == 0)
						{
							//System.out.println(single+", "+single+", "+single);
							return false;
						}
						else if((single + 1) >= least)
						{
							//System.out.println((single-1)+", "+single+", "+(single+1));
							number_surprising --;
							return true;
						}
						else
						{
							return false;
						}
					}
					else
					{
						//System.out.println(single+", "+single+", "+single);
						return false;
					}
					
				case 1:
					if((single + 1) >= least)
					{
						return true;
					}
					else
						return false;
					
				case 2:
					if((single + 1) >= least)
					{
						return true;
					}
					else 
					{
						if((number_surprising > 0))
						{
							if((single + 2) >= least)
							{
								number_surprising --;
								return true;
							}
						}
						else
						{
							return false;
						}

					}
			}
		}
		return false;
	}
	
	
	public static void main(String[] args) throws IOException {
		//System.out.println("Begin cacluating");
		 FileInputStream fstream = new FileInputStream("rec/input.txt");
		  // Get the object of DataInputStream
		  DataInputStream in = new DataInputStream(fstream);
		  BufferedReader br = new BufferedReader(new InputStreamReader(in));
		  String strLine;
		  strLine = br.readLine();
		  int x = Integer.parseInt(strLine);
		  
		  int output_result = 0;

		  for(int i = 0; i < x; i++)
		  {
			  strLine = br.readLine();
			  get_numbers(strLine);
			  //System.out.println("googlers: "+number_googlers+" surprising: "+number_surprising+" least: "+least_number);

			  for(int k = 0; k < number_googlers; k++)
			  {
				  //System.out.println((k+1)+": "+triplets[k]);
				  if(canGreater(triplets[k], least_number))
				  {
					  output_result ++;  
				  }
			  }
			  System.out.println("Case #"+(i+1)+": "+output_result);
			  output_result = 0;
		  }
		  

	}

}

