import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

package jp.funnything.competition.util;

import java.util.Comparator;

import com.google.common.base.Objects;

public class Pair< T1 , T2 > {
    public static < T1 extends Comparable< T1 > , T2 extends Comparable< T2 > > Comparator< Pair< T1 , T2 > > getFirstComarator() {
        return new Comparator< Pair< T1 , T2 > >() {
            @Override
            public int compare( final Pair< T1 , T2 > o1 , final Pair< T1 , T2 > o2 ) {
                final int c = o1.first.compareTo( o2.first );
                return c != 0 ? c : o1.second.compareTo( o2.second );
            }
        };
    }

    public static < T1 extends Comparable< T1 > , T2 extends Comparable< T2 > > Comparator< Pair< T1 , T2 > > getSecondComarator() {
        return new Comparator< Pair< T1 , T2 > >() {
            @Override
            public int compare( final Pair< T1 , T2 > o1 , final Pair< T1 , T2 > o2 ) {
                final int c = o1.second.compareTo( o2.second );
                return c != 0 ? c : o1.first.compareTo( o2.first );
            }
        };
    }

    public T1 first;
    public T2 second;

    public Pair( final Pair< T1 , T2 > that ) {
        this.first = that.first;
        this.second = that.second;
    }

    public Pair( final T1 first , final T2 second ) {
        this.first = first;
        this.second = second;
    }

    @Override
    public boolean equals( final Object obj ) {
        if ( this == obj ) {
            return true;
        }

        if ( obj == null || getClass() != obj.getClass() ) {
            return false;
        }

        final Pair< ? , ? > that = ( Pair< ? , ? > ) obj;

        return Objects.equal( this.first , that.first ) && Objects.equal( this.first , that.first );
    }

    @Override
    public int hashCode() {
        final int prime = 31;

        int result = 1;
        result = prime * result + ( first == null ? 0 : first.hashCode() );
        result = prime * result + ( second == null ? 0 : second.hashCode() );

        return result;
    }

    @Override
    public String toString() {
        return "Pair [first=" + first + ", second=" + second + "]";
    }
}
