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

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

public class Dancing 
{
    public static void main(String[] args) throws FileNotFoundException, IOException 
    {
        IO.changeGoogleIO('B', 0);
        
        Scanner input = new Scanner(System.in);
        
        int T = input.nextInt();
        int N, S, p, min, now;
        int result0;
        String result;
        
        for (int i = 0; i < T; ++i) 
        {
            result = "Case #" + (i + 1) + ": ";
            
            result0 = 0;
            
            N = input.nextInt();
            S = input.nextInt();
            p = input.nextInt();
            min = 3 * (p - 1);
            
            for (int j = 0; j < N; ++j)
            {
                now = input.nextInt();
                
                if (now > min)
                    ++result0;
                else if ((now > (min - 2)) && (now > 0) && (S > 0))
                {
                    ++result0;
                    --S;
                }
            }
            
            result += result0;
            
            System.out.println(result);
        }
    }
}
