import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.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 memo[pos][supprize] = ret;
    }else if(supprize == 0){
      int ret = rec(memo , tlist , supprize, pos + 1, point) + (nmax >= point ? 1 : 0);
      return memo[pos][supprize] = 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 memo[pos][supprize] = 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));
    }
  }
}
