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.InputStreamReader;

import org.junit.Assert;

public class DancingWithTheGooglers {

	public static void main( final String[] args ) throws Exception {
		final BufferedReader br = new BufferedReader( new InputStreamReader( System.in ) );
		final int T = Integer.parseInt( br.readLine() );
		for ( int ii = 0; ii < T; ++ii ) {
			final String[] parts = br.readLine().split( " " );
			final int N = Integer.parseInt( parts[ 0 ] );
			final int S = Integer.parseInt( parts[ 1 ] );
			final int p = Integer.parseInt( parts[ 2 ] );
			final int[] t = new int[N];
			for ( int i = 0; i < N; ++i ) {
				t[ i ] = Integer.parseInt( parts[ i + 3 ] );
			}
			System.out.printf( "Case #%d: %d\n", ii + 1, solve( N, S, p, t ) );
		}
	}

	private static int solve( final int n, int s, final int p, final int[] t ) {
		int cnt = 0;
		for ( int i = 0; i < t.length; ++i ) {
			final int k = t[ i ] / 3;
			final int mod = t[ i ] % 3;
			if ( k + ( mod > 0 ? 1 : 0 ) >= p ) {
				++cnt;
			} else if ( s > 0 ) {
				// k + k + k -> k+1 + k + k-1
				if ( mod == 0 && k - 1 >= 0 && k + 1 >= p ) {
					++cnt;
					--s;
				}

				// k+1 + k + k -> k+1 + k+1 + k-1 (not enough) || k+2 + k + k-1 (not ok)

				// k+1 + k+1 + k -> k+2 + k + k
				if ( mod == 2 && k + 2 >= p ) {
					++cnt;
					--s;
				}
			}
		}
		return cnt;
	}

	@org.junit.Test
	public void statement1() {
		final int[] t = { 15, 13, 11 };
		Assert.assertEquals( 3, solve( 3, 1, 5, t ) );
	}

	@org.junit.Test
	public void statement2() {
		final int[] t = { 23, 22, 21 };
		Assert.assertEquals( 2, solve( 3, 0, 8, t ) );
	}

	@org.junit.Test
	public void statement3() {
		final int[] t = { 8, 0 };
		Assert.assertEquals( 1, solve( 2, 1, 1, t ) );
	}

	@org.junit.Test
	public void statement4() {
		final int[] t = { 29, 20, 8, 18, 18, 21 };
		Assert.assertEquals( 3, solve( 6, 2, 8, t ) );
	}

}
