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();
	}
}

import java.io.*;
import java.util.*;

/**
 *
 * @author kronenthaler
 */
public class B {
	static HashMap<Integer, Set<ArrayList<Integer>>> cache = new HashMap<Integer, Set<ArrayList<Integer>>>();
	public static void main(String arg[]){
		try{
			int max = 0;
			for(int i=0;i<=10;i++){
				for(int j=0;j<=10;j++){
					for(int k=0;k<=10;k++){
						if(Math.abs(i-j)<=2 && Math.abs(j-k)<=2 && Math.abs(i-k)<=2){
							if(cache.get(i+j+k)==null)
								cache.put(i+j+k, new HashSet<ArrayList<Integer>>());
							ArrayList<Integer> a = new ArrayList<Integer>();
							a.add(i);
							a.add(j);
							a.add(k);
							Collections.sort(a);
							cache.get(i+j+k).add(a);
							max = Math.max(max, cache.get(i+j+k).size());
						}
					}
				}
			}

			Scanner in = new Scanner(new FileInputStream("b-small.in"));
			//Scanner in = new Scanner(new FileInputStream("b-large.in"));
			System.setOut(new PrintStream("b.out"));
			int T = in.nextInt();
			for(int cases=1;cases<=T;cases++){
				int n = in.nextInt();
				int s = in.nextInt();
				int p = in.nextInt();
				int g[] = new int[n];
				
				for(int i=0;i<n;i++){
					g[i] = in.nextInt();
				}

				System.out.printf("Case #%d: %d\n",cases, bt(g,s,p,0,0));
			}
		}catch(Exception e){
			e.printStackTrace();
		}
	}

	static int bt(int[]g, int s, int p, int acum, int current){
		if(current == g.length) return s==0?acum:-1;
		int max = -1;
		Set<ArrayList<Integer>> a = cache.get(g[current]);
		for(ArrayList<Integer> arr : a){
			if(Math.abs(arr.get(0)-arr.get(2))==2){
				if(s!=0)
					max = Math.max(max, bt(g, s-1, p, acum + (arr.get(2)>=p?1:0), current+1));
			}else{
				max = Math.max(max, bt(g, s, p, acum + (arr.get(2)>=p?1:0), current+1));
			}
		}
		return max;
	}
}
