/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

package jp.funnything.competition.util;

import java.util.Arrays;
import java.util.List;

import com.google.common.collect.Lists;
import com.google.common.primitives.Ints;
import com.google.common.primitives.Longs;

public class Prime {
    public static class PrimeData {
        public int[] list;
        public boolean[] map;

        private PrimeData( final int[] values , final boolean[] map ) {
            list = values;
            this.map = map;
        }
    }

    public static long[] factorize( long n , final int[] primes ) {
        final List< Long > factor = Lists.newArrayList();

        for ( final int p : primes ) {
            if ( n < p * p ) {
                break;
            }

            while ( n % p == 0 ) {
                factor.add( ( long ) p );
                n /= p;
            }
        }

        if ( n > 1 ) {
            factor.add( n );
        }

        return Longs.toArray( factor );
    }

    public static PrimeData prepare( final int n ) {
        final List< Integer > primes = Lists.newArrayList();

        final boolean[] map = new boolean[ n ];
        Arrays.fill( map , true );

        map[ 0 ] = map[ 1 ] = false;

        primes.add( 2 );
        for ( int composite = 2 * 2 ; composite < n ; composite += 2 ) {
            map[ composite ] = false;
        }

        for ( int value = 3 ; value < n ; value += 2 ) {
            if ( map[ value ] ) {
                primes.add( value );
                for ( int composite = value * 2 ; composite < n ; composite += value ) {
                    map[ composite ] = false;
                }
            }
        }

        return new PrimeData( Ints.toArray( primes ) , map );
    }
}
