Problem:
 Score: 200 points    Problem 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.      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.        Sample Input 1 0 5      Sample Output 1 5  The integers that can be divided by 100 exactly 0 times (that is, not divisible by 100 ) are as follows: 1 , 2 , 3 , 4 , 5 , 6 , 7 , ... Thus, the 5 -th smallest integer that would make Ringo happy is 5 .       Sample Input 2 1 11      Sample Output 2 1100  The integers that can be divided by 100 exactly once are as follows: 100 , 200 , 300 , 400 , 500 , 600 , 700 , 800 , 900 , 1 \ 000 , 1 \ 100 , ... Thus, the integer we are seeking is 1 \ 100 .       Sample Input 3 2 85      Sample Output 3 850000  The integers that can be divided by 100 exactly twice are as follows: 10 \ 000 , 20 \ 000 , 30 \ 000 , ... Thus, the integer we are seeking is 850 \ 000 .

Solution (Python):
d,n = map(int,input().split())
if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    if n == 100:
        print(10100)
    else:
        print(n*100)
elif d == 2:
    if n == 100:
        print(1010000)
    else:
        print(n*10000)

Solution (Python):
d,n=map(int, input().split())
if n == 100:
    print(101 * n**d)
else:
    print(100**d * n)

Solution (Python):
d,n=map(int, input().split())
if d == 0 and n == 100:
    print(101)
elif d == 1 and n == 100:
    print(10100)
elif d == 2 and n == 100:
    print(1010000)
else:
    print(100**d * n)

Solution (Python):
D,N=map(int,input().split())
ans=0
if N == 100:
	ans=(100**D)*(N+1)  
else:
	ans=(100**D)*N

       
  
print(ans)

Solution (Python):
d, n = map(int, input().split())
if n != 100:
  print(n*100**d)
else:
  print(101*100**d)

Solution (Python):
a,b = [int(i) for i in input().split()]

if b == 100:
    print(100**a*101)
else:
    print(100**a*b)

Solution (Python):
d, n = input().split()
d = int(d)
if n == "100":
    n = "101"
print(n + "0" * (d*2))

Solution (Python):
d,n = map(int,input().split())
if n != 100:
    print(n*100**d)
else:
    print(101*100**d)

Solution (Python):
D,N = map(int,input().split())

if N < 100:
    print(N*100**D)
else:
    print(101*100**D)

Solution (Python):
s = list(map(int,input().split()))

if s[0] == 0:
    if s[1] == 100:
        print('101')
    else:
        print(s[1])
elif s[0] == 1:
    if s[1] == 100:
        print('10100')
    else:
        print(s[1]*100)
elif s[0] == 2:
    if s[1] == 100:
        print('1010000')
    else:
        print(s[1]*10000)

Solution (Python):
d,n =map(int,input().split())
if n == 100: n =101
print(n*(100**d))

Solution (Python):
D, N = map(int, input().split())

if N != 100:
    print(N * 100 ** D)
else:
    print((N + 1) * 100 ** D)

Solution (Python):
D, N = map(int, input().split())
if N == 100:
    N = 101
print((100 ** D) * N)

Solution (Python):
a,b = list(map(int, input().split()))
print((100**a)*b if b != 100 else (100**a)*(b+1))

Solution (Python):
d,n=map(int,input().split())
if n==100:
    print(100**d*(n+1))
else:
    print(100**d*n)

Solution (Python):
D, N = map(int, input().split())
ans = 100**D
for i in range(N - 1):
    ans += 100**D
    if ans % 100**(D + 1)==0:
        ans += 100**D
print(ans)

Solution (Python):
D, N = map(int, input().split())

if N <= 99:
    print((100 ** D) * N)
else:
    print((100 ** D) * 101)

Solution (Python):
d, n = map(int, input().split())

if n != 100:
    print(n * 100 ** d)
else:
    print((n + 1) * 100 ** d)

Solution (Python):

import sys


def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

D, N = ISI()
num = 100 ** D
if N < 100:
    print(num*N)
else:
    print(num*101)

Solution (Python):
n,d=map(int,input().split())
num=100**n
if d<100:
  ans=num*d
  print(ans)
else:
  print(101*num)

Solution (Python):
d,n = map(int,input().split())

if n != 100:
    print((100**d)*n)
else:
    print((100**d)*(n+1))

Solution (Python):

d,n = map(int,input().split())
ans = 100**d * n
if n==100:
  ans +=100**d
print(ans)

Solution (Python):
D, N = map(int, input().split())
ans = 100**D * N
if N==100:
  ans +=100**D
print(ans)

Solution (Python):
(d, n) = (int(tok) for tok in input().split())
if n == 100:
  n += 1
  
print(100 ** d * n)

Solution (Python):
D, N = map(int, input().split())
if N == 100:
  N = 101
r = N*(100**D)
print(r)

Solution (Python):
D, N = map(int, input().split())

if N == 100:
    N += 1
print("{}{}".format(N, "00"*D))

Solution (Python):
d,n = map(int,input().split())
 
if d == 0:
  if n == 100:
    print(101)
  else:
    print(n)
elif d == 1:
  if n == 100:
    print(10100)
  else:
    print(100*n)
elif d == 2:
  if n == 100:
    print(1010000)
  else:
    print(10000*n)

Solution (Python):
d,n=map(int,input().split())
print(n*100**d if n!=100 else (n+1)*100**d)

Solution (Python):
d,n = map(int,input().split())
if d == 0 and 1<=n<=99:
  print(n)
elif d == 0 and n ==100:
  print(101)
elif d == 1 and 1<=n<=99:
  print(100*n)
elif d == 1 and n ==100:
   print(101*n)
elif d == 2 and 1<=n<=99:
  print(10000*n)
elif d == 2 and n ==100:
   print(10100*n)

Solution (Python):
D, N = map(int, input().split())
if N == 100:
    N += 1
print(100**D*N)

Solution (Python):
d, n = map(int, input().split())

if d == 0:
    print(n+n//100)
elif d == 1:
    if n == 100:
        print(100*n+100)
    else:
        print(100*n)
else:
    if n == 100:
        print(100**2*n+100**2)
    else:
        print(100**2*n)

Solution (Python):
import sys
from collections import deque
from collections import  Counter
import statistics
import math
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

d, n = na()
if n != 100:
    print(100 ** d * n)
else:
    print(101 * (100 ** d))

Solution (Python):
import sys
from collections import deque
from collections import  Counter
import statistics
import math
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

d, n = na()
ct = 0
s = 100
if d == 0:
    if n != 100:
        print(n)
    else:
        print(101)
elif d == 1:
    if n != 100:
        print(100 * n)
    else:
        print(10100)
else:
    if n != 100:
        print(10000 * n)
    else:
        print(1010000)

Solution (Python):
d,n=map(int,input().split())
if n<100:
  print(100**d*n)
else:
  print(100**d*101)

Solution (Python):
D, N = map(int, input().split())
if N != 100:
  print((100**D)*N)
else:
  print((100**D)*101)

Solution (Python):
d,n=map(int,input().split())

if d==0:
  if n==100:
    print(101)
  else:
    print((100**d)*n)
else:
  if n==100:
     print((100**d)*(n+1))
  else:
     print((100**d)*n)

Solution (Python):
d, n = map(int, input().split())
if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
else:
    if n == 100:
        print((100 ** d) * (n + 1))
    else:
        print((100 ** d) * n)

Solution (Python):
d,n=map(int,input().split())
print(n*100**d if n<100 else 101*100**d)

Solution (Python):
D, N = map(int, input().split())

print(N*100**D) if N != 100 else print(101*100**D)

Solution (Python):
D,N=map(int,input().split())
if N==100:
    print(100**D*101)
else:
    print(100**D*N)

Solution (Python):
d,n = map(int, input().split())
if n==100:
  print(100**d * 101)
else:
  print(100**d * n)

Solution (Python):
D, N = map(int, input().split())

if(N == 100):
    N += 1

print(100**D*N)

Solution (Python):
a, b = map(int, input().split())
if b == 100:
  b += 1
print(b * (100 ** a))

Solution (Python):
import sys
import math
from fractions import gcd





def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""


 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

D, K =  map(int, sys.stdin.readline().split())

if K == 100:
    print(100 ** (D + 1) + 100 ** D)
else:
    print(100 ** D * K)

Solution (Python):
d, n = map(int, input().split())
add_value = 100 ** d
value = 0
count = 0
while True:
    count+=1
    value += add_value
    if (value // add_value) % 100 == 0:
        value += add_value
    if count == n:
        break
print(value)

Solution (Python):
d,n=map(int,input().split())
if d==0:
    ans=n+n//100
if d==1:
    ans=n*100+n*100//10000*100
if d==2:
    ans=n*10000+n*10000//1000000*10000
print(ans)

Solution (Python):
d, n = map(int, input().split())

if n == 100:
    n += 1
print(n * 100 ** d)

Solution (Python):
d,n = map(int,input().split())
if d ==0:
  if n!=100:
    print(n)
  else:
    print(101)
elif d == 1:
  if n!=100:
    print(n*100)
  else:
    print(101*100)
else:
  if n!=100:
    print(n*10000)
  else:
    print(1010000)

Solution (Python):
d, n = map(int, input().split())

if n != 100:
  print((100 ** d) * n)
  
else:
  print((100 ** d) * 101)

Solution (Python):
d, n = map(int, input().split())
print(100**d*n if n<100 else 100**d*101)

Solution (Python):
import sys
from collections import deque
from functools import reduce
import copy
import math


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [D, n] = string_to_int(inputs[0])
    N = n + 1 if n == 100 else n
    adder = reduce(lambda acc, _: acc * 100, range(D), 1)
    count = 0
    for _ in range(N):
        count += adder
    return count


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Solution (Python):
d, n = map(int, input().split())

if n == 100:
    n+=1

ans = n*(100**d)
print(ans)

Solution (Python):
d,n = map(int, input().split())
if n==100:
  print(100**d * 101)
else:
  print(100**d * n)

Solution (Python):
d,n = map(int,input().split())
if n == 100:
    n += 1
print(n*100**d)

Solution (Python):
def test():
    d,n = map(int,input().split())
    if n == 100:
        n += 1
    print(100**d*n)


if __name__ == "__main__":
    test()

Solution (Python):
D,N = map(int,input().split())
if N == 100:
  print(101 * (100 ** D))
else:
  print(N * (100 ** D))

Solution (Python):
x,y = map(int,input().split())
if(y==100):
    y+=1
print((100**x)*y)

Solution (Python):


def main():

    D,N = map(int,input().split())
    if N==100:
        N=101
    print(100**D*N)

if __name__== "__main__":
    main()

Solution (Python):
d, n = map(int, input().split())
d10 = 1
if d == 0 and n !=100:
    print(n)
elif d == 0 and n == 100:
    print(101)
else:
    for i in range(d):
        d10 *=100
    if n ==100:
        print(101*d10)
    else:
        print(n*d10)

Solution (Python):
def main():
    D, N = map(int, input().split())
    v = pow(100, D)
    if N != 100:
        return v * N
    else:
        return v * (N+1)

if __name__ == '__main__':
    print(main())

Solution (Python):
D, N = map(int, input().split())
if N == 100: N += 1
if D == 0: print(N)
else: print(100**D*N)

Solution (Python):
D, N = map(int, input().split())
N = N + N//100
print ( 100 ** D * N)

Solution (Python):
d,n=map(int,input().split())
print(100**d*(n+n//100))

Solution (Python):
d, n = map(int, input().split())
if n == 100:
    print((n + 1) * (100 ** d))
else:
    print(n * (100 ** d))

Solution (Python):
d, n = (int(i) for i in input().split())
if d == 0:
    if n != 100:
        print(n)
    else:
        print(n+1)
elif d == 1:
    if n != 100:
        print(100*n)
    else:
        print(100*(n+1))
elif d == 2:
    if n != 100:
        print(10000*n)
    else:
        print(10000*(n+1))

Solution (Python):
def solve():
    d, n = map(int, input().split())
    return (n + (n - 1) // 99) * (100 ** d)


if __name__ == "__main__":
    print(solve())

Solution (Python):
d, n = map(int,input().split())
cnt = 0
i = 0
if d == 0:
    while cnt < n:
        i += 1
        if i % 100 != 0:
            cnt+= 1
elif d == 1:
    while cnt < n:
        i += 1
        if i % 100 == 0 and i % (100**2) != 0:
            cnt += 1
else:
    while cnt < n:
        i += 1
        if i % (100**2) == 0 and i % (100**3) != 0:
            cnt += 1
print(i)

Solution (Python):

d, n = map(int, input().split())
if d == 0:
    start = 1
elif d == 1:
    start = 100
else:
    start = 10000

if n <= 99:
    print(start * n)
else:
    print(start * 101)

Solution (Python):
D, N = [int(x) for x in input().split()]
if N == 100:
  N = 101
print((100 ** D) * N)

Solution (Python):
a,b=map(int,input().split())
if b!=100:
  print(b*100**a)
else:
  print((b+1)*100**a)

Solution (Python):
x,y=map(int,input().split())
if y==100:
  y+=1
z=y*(100**x)
print(z)

Solution (Python):
D, N = map(int, input().split())

if N != 100:
  print(N * (100 ** D))
else:
  print(101 * (100 ** D))

Solution (Python):
d, n = map(int, input().split())
dd = 100 ** d
cnt = 0
for i in range(10 ** 9):
    if i % 100 != 0:
        cnt += 1
    if cnt == n:
        print(i * dd)
        exit()

Solution (Python):
d, n = map(int, input().split())
print(100**d * (n+n//100))

Solution (Python):
d, n = map(int, input().split())
print((n + n//100) * 100 ** d)

Solution (Python):



d,n=input().split()
d,n=int(d),int(n)

if n!=100:
    print((100**d)*n)
else:
    print((100**d)*(n+1))

Solution (Python):
def main():
    D, N = map(int, input().split())

    if N == 100:
        N += 1

    print(100 ** D * N)

main()

Solution (Python):
D,N = list(map(int,input().split()))
 
if D == 0:
    if N != 100:
        print(N)
    else:
        print(N+1)
elif D == 1:
    if N != 100:
        print(N * 100)
    else:
        print(N * 100 + 100)
else:
    if N != 100:
        print(N * 100 ** 2)
    else:
        print(N * 100 ** 2 + 10000)

Solution (Python):
import math
import copy
import sys


inputa = input().split()



a = int(inputa[0])
b = int(inputa[1])






















if b == 100:
    ans = pow(100, a) * (b + 1)
else:
    ans = pow(100, a) * b
print(int(ans))

Solution (Python):
d, n = map(int, input().split())
if n == 100:
    print(100 ** d * 101)
else:
    print(100 ** d * n)

Solution (Python):
d,n = [int(x) for x in input().split()]
print(100**d*(n+n//100))

Solution (Python):
D,N = map(int,input().split())
if N!=100:
  print(N*(100**D))
else:
  print((N+1)*(100**D))

Solution (Python):
d, n = map(int, input().split())
print(100 ** d * (n + 1)) if n == 100 else print(100 ** d * n)

Solution (Python):
d,n = map(int,input().split())
 
if n == 100:
  print(100**d*(n+1))
else:
  print(100**d*n)

Solution (Python):
import sys
input=sys.stdin.readline

d,n = map(int, input().split())
if n == 100:
    n += 1
print(100**d*n)

Solution (Python):
import sys
input=sys.stdin.readline
import fractions

d,n = map(int, input().split())
ans = 100**d*n
if d == 0:
    if ans == 100:
        ans += 1
elif d == 1:
    if ans == 10000:
        ans += 100
elif d == 2:
    if ans == 1000000:
        ans += 10000

print(ans)

Solution (Python):
D,N = map(int,input().split())

if N == 100:
  print(100**D*101)
else:
  print(100**D*N)

Solution (Python):
D,N = map(int,input().split())

if (N == 100):
  print(100**D * (N + 1))
else:
  print(100**D * N)

Solution (Python):
D, N = map(int, input().split())

if N==100:
    print(101*(100**D))
else:
    print(N*(100**D))

Solution (Python):
D, N = map(int, input().split())

if N == 100:
    num = 101 * (100**D)
else:
    num = N * (100**D)

print(num)

Solution (Python):
d,n=map(int,input().split())
if n==100:
  print(100**d*101)
else:
  print(100**d*n)

Solution (Python):
d,n = map(int,input().split())
if d == 0:
  if n != 100:
    print(n)
  else:
    print(101)
elif d == 1:
  if n != 100:
    print(100*n)
  else:
    print(10100)
elif d == 2:
  if n != 100:
    print(10000*n)
  else:
    print(1010000)

Solution (Python):
D, N = map(int, input().split())
if N == 100:
  N+=1
if D == 0:
  print(N)
elif D == 1:
  print(N*100)
else:
  print(N*10000)

Solution (Python):
D, N = map(int, input().split())
if N != 100:
    print(N * 100 ** D)
else:
    print(101 * 100 ** D)

Solution (Python):
l = [int(i) for i in input().split()]
d = l[0]
n = l[1]

if d == 0:
	if n != 100:
		print(n)
	else:
		print(n+1)
else:
	if n != 100:
		print((100**d)*n)
	else:
		print((100**d)*(n+1))

Solution (Python):
A = input().split()
D = int(A[0])
N = int(A[1])
 
if N != 100:
  print(100 ** D * N)
else:
  print(100 ** D * 101)

Solution (Python):
d, n = map(int,input().split())
if n<100:
    print((100**d)*n)
else:
    print((100**d)*101)

Solution (Python):
D,N=map(int,input().split())

if N!=100:
    print(N*(100**D))
elif D==0:
    print(101)
elif D==1:
    print(10100)
else:
    print(1010000)

Solution (Python):
A = input().split()
D = int(A[0])
N = int(A[1])

if N != 100:
  print(100 ** D * N)
else:
  print(100 ** D * 101)

Solution (Python):
D, N = map(int, input().split())
if N == 100:
    N += 1
print(N*100**D)

Solution (Python):

D, N = map(int, input().split())
if N != 100:
    if D == 0:
        print(N)
    elif D == 1:
        print(N * 100)
    elif D == 2:
        print(N * 10000)
else:
    if D == 0:
        print(N + 1)
    elif D== 1:
        print(N * 100 + 100)
    else:
        print(N * 10000 + 10000)

Solution (Python):
d,n = map(int,input().split())
if n == 100:
  n += 1
print( n * 100 ** d )

Solution (Python):
d, n = map(int, input().split())
d = 100 ** d
cnt = 0
for i in range(d, 10 ** 9, d):
    if i // d % 100 != 0:
        cnt += 1
    if cnt == n:
        print(i)
        exit()

Solution (Python):
d, n = map(int, input().split())
if n != 100:
  ans = 100 ** d * n
else:
  ans = 100 ** d * 101
print(ans)

Solution (Python):
d,n = map(int,input().split())
print((n+n//100)*100**d)

Solution (Python):
D,N=map(int,input().split())
if N==100:
	N+=1
print(100**D*N)

Solution (Python):
d, n = map(int, input().split())
x = 1100000
cnt = 1
for i in range(x):
    if i % 100**d == 0 and i % 100**(d+1) != 0:
        if cnt == n:
            print(i)
            exit()
        cnt += 1

Solution (Python):
D,N=map(int, input().split())

if N == 100:
    print(101*(100**D))
else:
    print(N*(100**D))

Solution (Python):
D,N=map(int, input().split())
if N==100:
  print(101 if D==0 else (100**D)*101)
else:
  print((100**D)*N if D!=0 else N)

Solution (Python):
d,n=map(int,input().split())
if n==100:
	n+=1
print(100**d*n)

Solution (Python):
d,n=map(int,input().split())
if n!=100:
    print(n*(100**d))
else:
    print(101*(100**d))

Solution (Python):
D, N = map(int, input().split())

if N == 100:
    print(100 ** D * 101)
else:
    print(100 ** D * N)

Solution (Python):
a,b=map(int,input().split());print(100**a*(b+(b>99)))

Solution (Python):
D,N = list(map(int,input().split(' ')))

ar = []
if N <100:
  for i in range(1,N+1):
    ar.append(100**D*i)
else:
  for i in range(1,N+2):
    ar.append(100**D*i)
    
  
print(ar[-1])

Solution (Python):
D, N = map(int, input().split())
if N ==100:
    N += 1
ans = (100 ** D) * N
print(ans)

Solution (Python):
D, N = map(int, input().split())

if N != 100:
  print(100**D * N)
else:
  print(100**D * 101)

Solution (Python):
a,b=list(map(int, input().split()))
if b != 100:
    print(100**a*b)
else:
    print(100**a*(b+1))

Solution (Python):
d, n = map(int, input().split())
if n == 100:
    n += 1
print((100**d)*n)

Solution (Python):
d, n = map(int, input().split())
if n == 100:
    n += 1
print(str(n) + "00" * d)

Solution (Python):
d, n = map(int, input().split())
if n == 100:
  n = 101
if d == 0:
  print(n)
else:
  print(100**d*n)

Solution (Python):
d, n = map(int, input().split())
ans = (100 ** d) * n
if n == 100:
  ans += n ** d
  
print(ans)

Solution (Python):
d, n = map(int, input().split())
ans = (100 ** d) * n
if n == 100:
  ans += n ** d
print(ans)

Solution (Python):
d,n = map(int,input().split())


i = 1
ans = 0

while True:
    cnt = 0
    s = i
    while s%100 == 0:
        s /= 100
        cnt += 1
        
    if cnt == d:
        ans += 1
        if ans == n:
            break
    i += 1
    
print(i)

Solution (Python):
D, N = map(int, input().split())
if N != 100:
    print(N * 100 ** D)
else:
    print((N + 1) * 100 ** D)

Solution (Python):
a, b = map(int, input().split())
c = 100 ** a
d = 0
e = 0
while True:
    d += c
    if d // c != 100:
        e += 1
    if e == b:
        print(d)
        exit()

Solution (Python):
D,N = map(int,input().split())
if N == 100:
  N = N + 1
print(N * 100**D)

Solution (Python):
d, n = map(int, input().split())
if n == 100:
  print(101 * (100 ** d))
else:
  print(n * (100 ** d))

Solution (Python):
d,n = map(int,input().split())
if n == 100:
    n += 1
print(n*(100**d))

Solution (Python):
a, b = map(int, input().split())

count = 0
i = 0
while count != b:
    if i %100 != 0:
        count += 1
    i += 1


ans = 100 **a * (i-1)
print(ans)

Solution (Python):
d,n=map(int,input().split())
print(n*100**d if n!=100 else 101*100**d)

Solution (Python):
D, N = map(int, input().split())
if N == 100:
    print((N+1)*(100**D))
else:
    print(N*(100**D))

Solution (Python):

d, n = map(int, input().split())


if n == 100:
    n = n + 1

tail = "00" * d
s = str(n) + tail
print(s)

Solution (Python):
d, n = map(int, input().split())

print(n * 100 **d if n != 100 else 101 *100**d )

Solution (Python):
D, N = map(int, input().split())

start = 100 ** D
if N == 100:
    N += 1
print(start * N)

Solution (Python):
D, N = [int(x) for x in input().split()]

if D == 0:
	if N == 100:
		print(101)
	else:
		print(N)
else:
	if N == 100:
		print(100 ** D * 101)
	else:
		print(100 ** D * N)

Solution (Python):

A = [int(el) for el in input().split(' ')]
if A[1] != 100:
    print(100**A[0] * A[1])
else:
    print(100**A[0] * 101)

Solution (Python):
d,n = map(int,input().split())
print((n+n//100)*(100**d))

Solution (Python):
D, N = map(int, input().split())
print(N * 100 ** D if N < 100 else 101 * 100 ** D)

Solution (Python):
d,n=map(int,input().split())
if n==100:
    n=101
print(100**d*n)

Solution (Python):
a, b = map(int, input().split())

if b != 100:
    print(b * 100 ** a)
else:
    print(101 * 100 ** a)

Solution (Python):
def calc(x):
    ret = 0
    while x % 100 == 0:
        x /= 100
        ret += 1
    return ret

D, N = map(int, input().split())
cnt, val = 0, 0
while cnt < N:
    val += 1
    if calc(val) == D:
        cnt += 1
print(val)

Solution (Python):
D,N=map(int, input().split())
x=100**D
ans=x*N
if N==100:
  ans+=x
  
print(ans)

Solution (Python):
def main():
    D, N = map(int, input().split())
    if N == 100:
        N = 101
    print(100**D * N)


if __name__ == "__main__":
    main()

Solution (Python):
D, N = map(int, input().split())
ans = []
if D == 0:
    for i in range(110):
        if i % 100 != 0:
            ans.append(i)
elif D == 1:
    for i in range(100, 10101, 100):
        if i != 10000:
            ans.append(i)
else:
    for i in range(10000, 1010001, 10000):
        if i != 1000000:
            ans.append(i)

print(ans[N - 1])

Solution (Python):
D,N = map(int, input().split())

if D == 0:
    if N != 100:
        print(N)
    else:
        print(101)

elif D == 1:
    if N != 100:
        print(100*N)
    else:
        print(100*101)

elif D == 2:
    if N != 100:
        print(100*100*N)
    else:
        print(100*100*101)

Solution (Python):
D, N = map(int, input().split())
if N == 100:
  print(100**D*101)
else:
  print(100**D*N)

Solution (Python):
D, N = map(int, input().split())
if D == 0:
  if N == 100:
    print(101)
  else:
  	print(N)
elif D == 1:
  if N == 100:
    print(10100)
  else:
    print(N*100)
else:
  if N == 100:
    print(1010000)
  else:
    print(N*10000)

Solution (Python):
"""


 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())


 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  


a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    D,N = map(int, sys.stdin.readline().split())
    if N != 100:
        print((100**D)*N)
    else:
        print((100**D)*101)

Solution (Python):
d,n = map(int,input().split())
m = n
for i in range(1,n+1):
    if i % 100 == 0:
        m += 1
print(100 ** d * m)

Solution (Python):
d,n = map(int,input().split())
if n != 100:
    res = 100**d * n
else:
    res = 100**d * (n+1)
print(res)

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    a, b = LI()
    if a <= 8 and b <= 8:
        print("Yay!")
    else:
        print(":(")
    return


def B():
    d, n = LI()
    print(str(n * (n != 100) or n + 1) + "00" * d)
    return


def C():
    return


def D():
    return


if __name__ == '__main__':
    B()

Solution (Python):
D, N = map(int, input().split())

if N!=100:
    print((100**D)*N)
else:
    print((100**D)*101)

Solution (Python):
d, n = map(int, input().split())

if n == 100:
  print(100 ** d * (n + 1))
else:
  print(100 ** d * n)

Solution (Python):
d,n=map(int,input().split())
print([n,101][n==100]*100**d)

Solution (Python):
import os, sys, re, math

D,N = map(int,input().split(' '))





cnt = 0
cur = 0

while cnt < N:
    cur += 100 ** D
    if cur // 100 ** D != 100:
        cnt += 1

print(cur)

Solution (Python):
import os, sys, re, math

D,N = map(int,input().split(' '))
ret = (100 ** D) * N
if N == 100:
    ret += 100 ** D
print(ret)

Solution (Python):
a, b = map(int,input().split())
c = 100 ** a
e = 0
for i in range(b):
    e += c
print(e + c * (b // 100))

Solution (Python):
a = input()
d, n = [int(b) for b in a.split()]
if (n == 100):
	print (100**d * (n + 1))
else:
	print (100**d * n)

Solution (Python):
import os, sys, re, math

lines = sys.stdin.readlines()

(d, n) = lines[0].split()

d = int(d)
n = int(n)
if (n == 100):
    n = 101
print (100 ** d * n)

Solution (Python):
import math

a, b = map(int, raw_input().split(' '))
seed = 10000 // math.pow(100, 2 - a)
if b == 100: 
    b += 1
print int(seed * b)

Solution (Python):
d, n = map(int, input().split())
print((n if n < 100 else n + 1) * (100 ** d))

Solution (Python):

D, N = map(int, input().split(' '))

if D == 0:
    if N == 100:
        print(101)
    else:
        print(N)
elif D == 1:
    if N == 100:
        print(10100)
    else:
        print(100*N)
elif D == 2:
    if N == 100:
        print(1010000)
    else:
        print(10000*N)

Solution (Python):
d, n = map(int, input().split())
print(pow(100, d) * n if n != 100 else pow(100, d) * (n+1))

Solution (Python):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    D, N = (int(_) for _ in input().split())
    if N!=100:
        print(100**D * N)
    else:
        print(100**D * N + 1*(100**D))
        
if __name__ == '__main__':
    main()

Solution (Python):
D,N=map(int,input().split())

if N==100:
  N+=1
print(N*(100**D))

Solution (Python):
n,k=map(int,input().split())
if k==100:
  print(100**n*101)
else:
  print(100**n*k)

Solution (Python):
a, b = map(int, input().split())
print(100 ** a * (b + b // 100))

Solution (Python):
D,N=tuple(map(int,input("").split(" ")))

if N<=99:
    print((100**D)*N)
else:
    print((100**D)*(N+1))

Solution (Python):
d, n = map(int, input().split())
print(100**d * n) if n != 100 else print(100**d * (n + 1))

Solution (Python):
D, N = list(map(int, input().strip().split(' ')))
ans = (100 ** D) * N if N < 100 else (100 ** D) * (N + 1)
print(ans)

Solution (Python):

D, N = map(int, input().split())
ans = (100**D)*N

if(N==100):
    ans += 1*(100**D)
print(ans)

Solution (Python):
D,N = map(int, input().split())
List = []
if D == 0:
    if N == 100:
        ans = 101
    else:
        ans = N
elif D == 1:
    if N == 100:
        ans = 10100
    else:
        ans = N * 100
else:
    if N == 100:
        ans = 1000000 + 10000
    else:
        ans = N * 10000
print(ans)

Solution (Python):
d, n = map(int, input().split(" "))
print((n + (n == 100)) * (100 ** d))

Solution (Python):
d,n = map(int,input().split())
if n != 100:
  print(n*100**d)
else:
  print((n+1)*100**d)

Solution (Python):
d, n = list(map(int, input().split()))
print((100 ** d) * n if n <= 99 else (100 ** d) * 101)

Solution (Python):
D, N = map(int, input().split())
if N==100:
    print(101*100**D)
else:
    print(N*100**D)

Solution (Python):
if __name__ == '__main__':
    D, N = map(int, input().split())

    print((N + N//100) * pow(100, D))

Solution (Python):
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    d, n = map(int, input().split())

    if n == 100:
        print(100 ** d * 101)
    else:
        print(100 ** d * n)

Solution (Python):
D,N = list(map(int,input().split()))

if N == 100:
  print((100**D)*(N+1))
else:
  print((100**D)*N)

Solution (Python):
d,n=map(int,input().split())
flag=0
if n == 100:flag=1
print(100**d*(n+flag))

Solution (Python):
d,n = map(int,input().split())

x = 100**d

ans = x*n
if n == 100:
  ans += x
print(ans)

Solution (Python):
N,D = map(int, input().split())
if D < 100:
    print(D*(100**N))
else:
    print((D+1)*(100**N))

Solution (Python):
D, N = map(int, input().split())

print((100 ** D) * (N if N != 100 else 101))

Solution (Python):
D,N = map(int, input().split())
if D == 0:
    if N != 100:
        print(N)
    else:
        print(101)
elif D == 1:
    if N != 100:
        print(N*100)
    else:
        print(10100)
else:
    if N != 100:
        print(N*10000)
    else:
        print(1010000)

Solution (Python):
D,N = map(int, input().split())
if N<100: print(N*100**D) 
else: print(101*100**D)