package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

package dancingwithgooglers;

import java.util.Scanner;

public class Main {

    static enum Mark {
        IMPOSSIBLE, SURPRISING, REGULAR;
    }

    static class Googler {
        
        private int total = 0;

        public Googler(int total)
        {
            this.total = total;
        }

        public Mark canGetMark(int mark)
        {
            if(mark > 10 || mark < 0) return Mark.IMPOSSIBLE;
            
            if(canGetMark(mark+1) == Mark.REGULAR) return Mark.REGULAR;

            if(mark + mark + mark == total) return Mark.REGULAR;
            if(mark > 0) if(mark + mark + mark - 1 == total) return Mark.REGULAR;
            if(mark > 0) if(mark + mark - 1 + mark - 1 == total) return Mark.REGULAR;
            if(mark < 10) if(mark + mark + mark + 1 == total) return Mark.REGULAR;
            if(mark < 10) if(mark + mark + 1 + mark + 1 == total) return Mark.REGULAR;

            if(canGetMark(mark+1) == Mark.SURPRISING) return Mark.SURPRISING;

            if(mark < 9) if(mark + mark + 1 + mark + 2 == total) return Mark.SURPRISING;
            if(mark < 9) if(mark + mark + 2 + mark + 2 == total) return Mark.SURPRISING;
            if(mark > 1) if(mark + mark - 1 + mark - 2 == total) return Mark.SURPRISING;
            if(mark > 1) if(mark + mark - 2 + mark - 2 == total) return Mark.SURPRISING;

            return Mark.IMPOSSIBLE;
        }

    }
   
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();

        for(int testCase = 1; testCase <= T; testCase++)
        {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();
            int result = 0;
            for(int i = 0; i < N; i++)
            {
                Googler googler = new Googler(sc.nextInt());
                Mark mark = googler.canGetMark(p);
                if(mark == Mark.REGULAR)
                {
                    result++;
                }
                else if(mark == Mark.SURPRISING && S > 0)
                {
                    result++;
                    S--;
                }
            }
            System.out.println("Case #"+testCase+": "+result);
        }
    }

}
