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 qual;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class B {
  static int rec(int[][] memo , List<Integer> tlist , int supprize , int pos , int point){
    int N = tlist.size();
    if(pos == N){
      return 0;
    }
    if(memo[pos][supprize] >= 0){
      return memo[pos][supprize];
    }
    int left = tlist.size() - pos;
    int ti = tlist.get(pos);
    int tave = ti / 3;
    int smax = ti % 3 == 2 ? tave + 2 : tave + 1;
    int nmax = ti % 3 == 0 ? tave     : tave + 1;
    if(supprize == left){
      int ret = rec(memo , tlist , supprize - 1 , pos + 1, point) + (smax >= point ? 1 : 0);
      return ret;
    }else if(supprize == 0){
      int ret = rec(memo , tlist , supprize, pos + 1, point) + (nmax >= point ? 1 : 0);
      return ret;
    }else{
      int ret = rec(memo , tlist , supprize - 1 , pos + 1, point) + (smax >= point ? 1 : 0);
      ret = Math.max(ret, rec(memo , tlist , supprize, pos + 1, point) + (nmax >= point ? 1 : 0));
      return ret;
    }
  }
  
  static int solve(int ts[] , int S , int p){
    List<Integer> tlist = new ArrayList<Integer>();
    int offset = 0;
    for(int t : ts){
      if(t == 0){
        if(p == 0)++offset;
      }else if(t == 1){
        if(p <= 1)++offset;
      }else if(t >= 29){
        ++offset;
      }else{
        tlist.add(t);
      }
    }
    int N = tlist.size();
    int dp[][] = new int[N][S + 1];
    for(int i = 0 ; i < N ; ++i){
      Arrays.fill(dp[i], -1);
    }
    return offset + rec(dp, tlist, S, 0 , p);
  }
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int T = sc.nextInt();
    for(int cn = 1 ; cn <= T ; ++cn){
      int N = sc.nextInt();
      int S = sc.nextInt();
      int p = sc.nextInt();
      int ts[] = new int[N];
      for(int i = 0 ; i < N ; ++i){
        ts[i] = sc.nextInt();
      }
      System.out.printf("Case #%d: %d\n", cn , solve(ts , S , p));
    }
  }
}
