output_description: Print the maximum possible number of happy children.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N x
      a_1 a_2 ... a_N
attempt: import copy
  
  n, x = list(map(int, input().split()))
  a_list = list(map(int, input().split()))
  
  res_count = 0
  
  
  def rec_count(a_list, ix=0):
      global res_count
      if len(a_list) == 0 or len(a_list) <= res_count:
          return None
      sum_a = sum(a_list)
      if sum_a == x:
          return len(a_list)
      if x > sum_a:
          return len(a_list) - 1
      c_list = [0]
      for i in range(ix, len(a_list)):
          tmp_a_list = copy.deepcopy(a_list)
          del tmp_a_list[ix]
          tmp_count = rec_count(tmp_a_list, i)
          if tmp_count is not None:
              c_list.append(tmp_count)
              if tmp_count > res_count:
                  res_count = tmp_count
      return max(c_list)
  
  
  tmp_count = rec_count(a_list)
  if tmp_count > res_count:
      res_count = tmp_count
  print(res_count)
  
problem_description: Statement
  
  There are N children, numbered 1, 2, ..., N.
  
  Snuke has decided to distribute x sweets among them. He needs to give out all
  the x sweets, but some of the children may get zero sweets.
  
  For each i (1 \leq i \leq N), Child i will be _happy_ if he/she gets exactly
  a_i sweets. Snuke is trying to maximize the number of happy children by
  optimally distributing the sweets. Find the maximum possible number of happy
  children.
samples: [{"input": "3 70\n    20 30 10", "output": "2\n    \n\nOne optimal way to distribute sweets is (20, 30, 20).\n\n* * *"}, {"input": "3 10\n    20 30 10", "output": "1\n    \n\nThe optimal way to distribute sweets is (0, 0, 10).\n\n* * *"}, {"input": "4 1111\n    1 10 100 1000", "output": "4\n    \n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\n* * *"}, {"input": "2 10\n    20 20", "output": "0\n    \n\nNo children will be happy, no matter how the sweets are distributed."}]