output_description: Print the N-th smallest integer that can be divided by 100 exactly D times.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      D N
attempt: import sys
  
  sys.setrecursionlimit(1 << 25)
  read = sys.stdin.readline
  ra = range
  enu = enumerate
  
  
  def read_ints():
      return list(map(int, read().split()))
  
  
  def read_a_int():
      return int(read())
  
  
  def read_tuple(H):
      """
      H is number of rows
      """
      ret = []
      for _ in range(H):
          ret.append(tuple(map(int, read().split())))
      return ret
  
  
  def read_col(H):
      """
      H is number of rows
      A列、B列が与えられるようなとき
      ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
      """
      ret = []
      for _ in range(H):
          ret.append(list(map(int, read().split())))
      return tuple(map(list, zip(*ret)))
  
  
  def read_matrix(H):
      """
      H is number of rows
      """
      ret = []
      for _ in range(H):
          ret.append(list(map(int, read().split())))
      return ret
      # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため
  
  
  MOD = 10**9 + 7
  INF = 2**31  # 2147483648 > 10**9
  # default import
  from collections import defaultdict, Counter, deque
  from operator import itemgetter
  from itertools import product, permutations, combinations
  from bisect import bisect_left, bisect_right  # , insort_left, insort_right
  
  # https://atcoder.jp/contests/abc100/tasks/abc100_b
  
  D, N = read_ints()
  if N == 100:
      N += 1
  print(N * (100**D))
  
problem_description: Statement
  
  Today, the memorable AtCoder Beginner Contest 100 takes place. On this
  occasion, Takahashi would like to give an integer to Ringo.  
  As the name of the contest is AtCoder Beginner Contest 100, Ringo would be
  happy if he is given a positive integer that can be divided by 100 **exactly**
  D times.
  
  Find the N-th smallest integer that would make Ringo happy.
samples: [{"input": "0 5", "output": "5\n    \n\nThe integers that can be divided by 100 exactly 0 times (that is, not\ndivisible by 100) are as follows: 1, 2, 3, 4, 5, 6, 7, ...  \nThus, the 5-th smallest integer that would make Ringo happy is 5.\n\n* * *"}, {"input": "1 11", "output": "1100\n    \n\nThe integers that can be divided by 100 exactly once are as follows: 100, 200,\n300, 400, 500, 600, 700, 800, 900, 1 \\ 000, 1 \\ 100, ...  \nThus, the integer we are seeking is 1 \\ 100.\n\n* * *"}, {"input": "2 85", "output": "850000\n    \n\nThe integers that can be divided by 100 exactly twice are as follows: 10 \\\n000, 20 \\ 000, 30 \\ 000, ...  \nThus, the integer we are seeking is 850 \\ 000."}]