/*
 * 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 qualifs;

import gcj.Gcj;

import java.util.List;

public class B {
	
	final String file;
	
	B (String f) {
		file = f;
	}
	
	public void run() {

		Gcj gcj = new Gcj(file);
		
		gcj.readLine();
		int ncase = gcj.iToken();
		
		for (int cas=1 ; cas <= ncase ; cas++) {
			
			gcj.readLine();
			int N = gcj.iToken();
			int S = gcj.iToken();
			int p = gcj.iToken();
			int[] t = gcj.iBunch();
			
			int up = 0;
			
			for (int i=0 ; i<N ; i++) {
				int x = t[i];
				
				if (x >= 28) {
					if (10 >= p) up++;
				}
				else if (x == 0) {
					if (0 >= p) up++;
				}
				else {
					int u = x / 3;
					int m = x % 3;
					if (m > 0) u++;
					if (u >= p) up++;
					else {
						if (S > 0 && m != 1) {
							u++;
							if (u >= p) {
								S--;
								up++;
							}
						}
					}
				}
			}

			Gcj.outcase(cas, false);
			System.out.println(up);
		}
		
		gcj.terminate();
		
	}
	
}
