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


public class Dancing
{
	public int specials = 0;
	
	public int p = 0;
	
	public static void main(String[] args) throws NumberFormatException, IOException 
	{
		 BufferedReader stdin = new BufferedReader
	     (new InputStreamReader(System.in));
		 int n = Integer.parseInt(stdin.readLine());
	     int j = 0;
	     
	     while(j<n)
	     {
	    	 String read = stdin.readLine();
	    	 String arr[] =  read.split("\\s");
	    	 int qty = Integer.parseInt(arr[0]);
	    	 int s = Integer.parseInt(arr[1]);
	    	 int p = Integer.parseInt(arr[2]);
	    	 Dancing dancing = new Dancing();
	    	 dancing.specials = s;
	    	 dancing.p = p;
	    	 int total = 0;
	    	 
	    	 for(int i = 3; i<qty+3; i++ )
	    	 {
	    		total += processGoogler(Integer.parseInt(arr[i]) , dancing);
	    	 }
	    	 StringBuffer sb = new StringBuffer();
	    	 sb.append("Case #"+(j+1)+": ");
	    	 sb.append(Integer.toString(total));
	    	 j++;
	    	 System.out.println(sb.toString());
	     }
		
	}



	private static int processGoogler(int t, Dancing dancing ) 
	{
		if( t == 0 && dancing.p == 0)
			return 1;
		int k = 0;
		if( t != 0)
		{
			if((t-1) % 3 == 0)
			{
				k = (t-1)/3;
				if(k+1>=dancing.p)
					return 1;
				return 0;
			}
			if(t % 3 == 0)
			{
				k = t/3;
				if(k>= dancing.p)
					return 1;
				if(dancing.specials>0)
				{
					if(k+1>=dancing.p)
					{
						dancing.specials--;
						return 1;
					}
				}
			}
			if( (t-2) % 3 == 0)
			{
				k =(t-2)/3;
				if(k+1>= dancing.p)
				{
					return 1;
				}
				if(dancing.specials>0)
				{
					if(k+2>=dancing.p)
					{
						dancing.specials--;
						return 1;
					}
				}
			}
		}
		return 0;
	}
}
