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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class Main {
	
	public static int calcWIS(int n){
		if(n - 2 < 0)
			return 0;
		return ((n - 2) / 3) + 2;
	}
	
	public static int calcWOS(int n){
		if(n - 1 < 0)
			return 0;
		return ((n - 1) / 3) + 1;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		//String fileName = args[0];
		String fileName = "googlers/B-small-attempt0.in";
		Scanner sC = null;
		try {
			sC = new Scanner(new File(fileName));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		int T = sC.nextInt();
		int N, S, p;
		int[] tab, wiS, woS;
		for(int i = 0; i < T; i++){
			N = sC.nextInt();
			S = sC.nextInt();
			p = sC.nextInt();
			tab = new int[N];
			wiS = new int[N];
			woS = new int[N];
			
			for(int j = 0; j < N; j++){
				tab[j] = sC.nextInt();
				wiS[j] = calcWIS(tab[j]);
				woS[j] = calcWOS(tab[j]);
				//System.out.println(tab[j] + " " + wiS[j] + " " + woS[j]);
			}
			
			int count = 0;
			
			for(int j = 0; j < N; j++){
				if(woS[j] >= p){
					count++;
				}
				if(woS[j] < p && wiS[j] >= p && S > 0){
					count++;
					S--;
				}
			}
			
			System.out.println("Case #" + (i + 1) + ": " + count);
			
		}

	}

}
