output_description: Print the maximum possible amount of the allowance.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B C
attempt: import time
  import collections
  import scipy.misc
  
  
  def prime_decomposition(n):
      i = 2
      table = []
      while i * i <= n:
          while n % i == 0:
              n /= i
              table.append(int(i))
          i += 1
      if n > 1:
          table.append(int(n))
      return table
  
  
  N, M = map(int, input().split())
  t_strt = time.time()
  
  factors = collections.Counter(prime_decomposition(M))
  t_elps = time.time()
  # print(f"{t_elps - t_strt} [sec]")
  num_pattern = 1
  
  for exponent in factors.values():
      tmp_num_pattern = scipy.misc.comb(exponent + N - 1, N - 1, exact=True)
      num_pattern = num_pattern * int(tmp_num_pattern)
  
  # print(num_pattern%(10**9+7))
  
  t_elps = time.time()
  print(f"{t_elps - t_strt} [sec]")
  
problem_description: Statement
  
  You have decided to give an allowance to your child depending on the outcome
  of the game that he will play now.
  
  The game is played as follows:
  
    * There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a `+` printed on it.
    * The player should construct a formula of the form X + Y, by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)
    * Then, the amount of the allowance will be equal to the resulting value of the formula.
  
  Given the values A, B and C printed on the integer panels used in the game,
  find the maximum possible amount of the allowance.
samples: [{"input": "1 5 2", "output": "53\n    \n\nThe amount of the allowance will be 53 when the panels are arranged as `52+1`,\nand this is the maximum possible amount.\n\n* * *"}, {"input": "9 9 9", "output": "108\n    \n\n* * *"}, {"input": "6 6 7", "output": "82"}]