Problem: 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.

Constraints

* D is 0, 1 or 2.
* N is an integer between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:


D N


Output

Print the N-th smallest integer that can be divided by 100 exactly D times.

Examples

Input

0 5


Output

5


Input

1 11


Output

1100


Input

2 85


Output

850000

Solution (in PYTHON):

Solution:
def solve(d, n):
    return (100**d) * (n + (n==100))

assert solve(0, 5) == 5
assert solve(1, 11) == 1100
assert solve(2, 85) == 850000
assert solve(0, 100) == 101
assert solve(1, 100) == 10100
assert solve(2, 100) == 1010000

d, n = map(int, raw_input().split())
print solve(d, n)