/*
 * 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 google.codejam;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class Stark_B {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new FileReader("B.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
		
		int total = sc.nextInt();
		
		
		
		for(int i=0; i<total; i++){
			pw.print("Case #" + (i + 1) + ": ");
			
			int cases = sc.nextInt();
			int surprise = sc.nextInt();
			int thold = sc.nextInt();
			
			int done=0;
			int cant=0;
			int mid=0;
			int ans=0;
			
			
			
			for(int j=0; j<cases; j++){
				int temp = sc.nextInt();
				
				int x = temp/3;
				int y = temp%3;
				
				if(x>=thold || (x==(thold-1) && y>0))	done++;
				else	if(((x==(thold-1)&&y==0)||(x==(thold-2) && y==2))&&(x>0))	mid++;
				else	cant++;
				
			}
			
			if(surprise<mid)	ans=done+surprise;
			else	ans = done+mid;
			
			
			pw.println(ans);
		}
			
	
			
			
			
		
		pw.flush();
		pw.close();
		sc.close();
	}
	
	

}
