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 N==100:
  N=101
print((100**D)*N)

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

Solution (Python):


def main():
    a, b = map(int, input().split())
    if b == 100:
        b = 101
    print((100 ** a) * b)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
d,n=map(int,input().split())
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
    if d == 0:
        print(n)
    else:
        print(100**d*n)

if __name__=='__main__':
    main()

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

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

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

Solution (Python):
def main():
  D, N = [int(x) for x in input().split()]
  if N == 100:
    print((N + 1) * (100**D))
  else:
    print(N * (100**D))


if __name__ == "__main__":
  main()

Solution (Python):
from sys import stdin

D, N = [int(x) for x in stdin.readline().rstrip().split()]

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

Solution (Python):
import sys
d,n = list(map(int, input().split()))
if d == 1:
    print((n+(n == 100))*100)
elif d == 2:
    print((n+(n == 100))*100*100 )
else:
    print(n if n != 100 else 101)

Solution (Python):
d,n=map(int,input().split())
a=[]
for i in range(1,100):
    a.append(i*100**d)
a.append(101*100**d)
a.append(102*100**d)
print(a[n-1])

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

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

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

Solution (Python):
d, n = map(int, input().split())
print(100 ** d * (n if n != 100 else 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*(N+1))
else:
    if N != 100:
        print(10000*N)
    else:
        print(10000*(N+1))

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())
if n == 100:
    n = 101
print((100**d)*n)

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

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

Solution (Python):

import numpy as np
import math
import re

x = input()
x = re.split(" ",x)
D = int(x[0])
N = int(x[1])

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

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

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

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

if N==100:
  print(100**D*N+100**D)
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 d == 0:
    if n <= 99:
        print(n)
    else:
        print(101)
if d == 1:
    if n <= 99:
        print(n*100)
    else:
        print(10100)
if d == 2:
    if n <= 99:
        print(n*10000)
    else:
        print(1010000)

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 = list(map(int, input().split()))
print(101*(100**D) if N==100 else N * 100**D)

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)
else:
    print((n+1) * 100**d)

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

x = 100**d

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

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

Solution (Python):
D,N=map(int,input().split())
if N==100:
    print(N*100**D+100**D)
    quit()
print(N*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())
print(100**d*n if n!=100 else 100**d*(n+1))

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)
else :
    print(100**d*101)

Solution (Python):
[D,N] = list(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(100**D*N)
elif N == 100:
    print(100**D*(N+1))

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

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

x = 100 ** d

if n == 100:
    print(x * 101)
else:
    print(x * 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 = [int(c) for c in input().split()]

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

Solution (Python):
d,n = [int(i) for i in 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:
    n+=1
if d==0:
    print(n)
elif d==1:
    print(100*n)
elif d==2:
    print(10000*n)

Solution (Python):
import sys

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

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

Solution (Python):
num = list(map(int,input()
.split()))
if num[1] !=100:
    if num[0] == 0:
        ans = num[1]
    elif num[0] == 1:
        ans = num[1]*100
    elif num[0] == 2:
        ans = num[1]*10000
else:
    if num[0] == 0:
        ans = num[1]+1
    elif num[0] == 1:
        ans = num[1]*100+100
    elif num[0] == 2:
        ans = num[1]*10000+10000

print(ans)

Solution (Python):

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

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

Solution (Python):
import sys
import numpy as np

readInt = lambda: int(sys.stdin.readline())
readIntN = lambda: [int(v) for v in sys.stdin.readline().split(' ')]

d, n = readIntN()
if n == 100:
    n = 101
ret = n * (100 ** d)
print(ret)

Solution (Python):
import sys

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

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

Solution (Python):
d,n=map(int,input().split())
if n==100:n=101
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 == 0:
  N += 1
s = pow(100, D) * N
print(s)

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

if N == 100:
  print('101'+'00'*D)
  exit()


print(str(N)+'00'*D)

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

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

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((100**d)*n)
else:
    print((100**d)*101)

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

if __name__ == '__main__':
	main()

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 N==100:
    N+=1
print((100**D)*N)

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

Solution (Python):


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

if d == 0 and n == 100:
    print(101)
elif d == 0:
    print(n)

if d == 1 and n == 100:
    print(10100)
elif d == 1:
    print(100 * n)

if d == 2 and n == 100:
    print(1010000)
elif d == 2:
    print(10000 * n)

Solution (Python):


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

if d == 0 and n == 100:
    print(101)
elif d == 0:
    print(n)

if d == 1 and n == 100:
    print(10100)
elif d == 1:
    print(100 * n)

if d == 2 and n == 100:
    print(1010000)
elif d == 2:
    print(10000 * n)

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:
    ans = (100 ** D) * 101
    print(ans)
else:
    ans = (100 ** D) * N
    print(ans)

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

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:
    N = 101
print(N*(100**D))

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

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

Solution (Python):
d0 = [i for i in range(102) if i != 100]
d1 = [i * 100 for i in d0]
d2 = [i * 100 for i in d1]

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

print([d0, d1, d2][D][N])

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

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

Solution (Python):

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

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

if N == 100:
    N += 1

print(N * (100**D))

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

Solution (Python):
D, N = map(int,input().split())
if N == 100:
  N=101
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:
    N = 101
if D == 0:
    print(N)
elif D == 1:
    print(N * 100)
else:
    print(N * (100 ** 2))

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+1)*100**d)
else:
    print(n*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())
count = 0
x = 0
while count != N:
  x += 1
  if x % 100 ** D == 0 and x % 100 ** (D + 1) != 0:
    count += 1
print(x)

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 <= 99:
    print((100**D)*N)
else:
    print(101*(100**D))

Solution (Python):

import sys
INF = float("inf")


def solve(D: int, N: int):
    if N != 100:
        print(str(N)+"00"*D)
    else:
        N = "101"
        print(str(N) + "00"*D)
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  
    N = int(next(tokens))  
    solve(D, N)


if __name__ == '__main__':
    main()

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

if n == 100:
  print(pow(100,d)*101)
else:
  print(pow(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())

if d == 0 and n == 100:
    print(101)
elif d == 0:
    print(n)

if d == 1 and n == 100:
    print(10100)
elif d == 1:
    print(100 * n)

if d == 2 and n == 100:
    print(1010000)
elif d == 2:
    print(10000 * n)

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

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

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

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(101*100**D)
else:
    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 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):
D,N = map(int, input().split())

if N == 100:
    N = 101

if D == 0:
    print(N)
elif D == 1:
    print(100 * N)
else:
    print(100 ** 2 * N)

Solution (Python):
import sys

input = sys.stdin.readline

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

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

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

num = [n for n in range(1, 102) if n % 100 != 0]

if D == 0:
  print(num[N-1]) 
if D == 1:
  print(num[N-1]*100)
if D == 2:
  print(num[N-1]*10000)

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

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

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

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:
    N+=1

ans = N * (100**D)

print(ans)

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

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

Solution (Python):
D, N = map(int, input().split())
if N == 100:
    print(list(range(0, 102))[N+1]*(100**D))
else:
    print(list(range(0, 101))[N]*(100**D))

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

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

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

res = N if N < 100 else 101
for i in range(D):
    res *= 100

print(res)

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

Solution (Python):
D,N = map(int,input().split())
print(100**D*N) if N != 100 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)
else:
    print(101*100**d)

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

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

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());d=100**d
if n==100:print(101*d)
else:print(n*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(100 * n)
    else:
        print(100*101)
else:
    if n != 100:
        print(10000 * n)
    else:
        print(10000 * 101)

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


for i in range(N):
  if N == 100:
    list_ans = [101 * 100 ** D]
    break
  list_ans = [n*100**D for n in range(1,N+1)]


print(list_ans[-1])


'''　考え方
1.d=0
1,2,3,4,5....
つまり、1*100**0,2*100**0


2.d=1
100,200,300...
つまり、1*100**1,2*100**1

3.d=2
10000,20000....
つまり、1*100**2,2*100**2...

Dの値に応じて、上記のリストをN個分まで出力すれば良い。
ただし、N=100の場合は割り算する回数が一回増えるので、その際のケアをする必要がある。
'''

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

ans = 1
for _ in range(D):
    ans *= 100
k = 0
for i in range(N):
    k += 1
    if k % 100 == 0:
        k += 1
ans *= k

print(ans)

Solution (Python):
d, n = map(int, input().split())
print(100 ** d * 101 if n == 100 else 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(n*101)
    else:
        print(n*100)
else:
    if n==100:
        print(n*10100)
    else:
        print(n*10000)

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(int((100**d)*n))
elif n==100:
    print(int((100**d)*101))

Solution (Python):
d,n = [int(item) for item in 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):
D,N=map(int,input().split())
Ans=N*(100**D)
if N!=100:
  print(Ans)
if N==100:
  c=100**D
  print(Ans+c)

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

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

Solution (Python):
d, n = [int(elem) for elem in input().split()]
if n <= 99:
  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((N+1)*100**D)

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

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

Solution (Python):
from sys import stdin
d,n=[int(x) for x in stdin.readline().rstrip().split()]
if n==100:
    if d==0:
        print(101)
    else:
        print((100**d)*101)
else:
    if d==0:
        print(n)
    else:
        print((100**d)*n)

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

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

Solution (Python):
d,n=map(int,input().split())
n=n+n//100
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())
res = n*100**d
if(n == 100) : res += 100**d
print(res)

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

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:
    print(101*100**D)
else:
    print(N*100**D)

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

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

Solution (Python):
d,n = map(int, input().split())
print((100**d)*(n+1) if n == 100 else (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:
  print(100**d*101)
else:
  print(100**d*n)

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

Solution (Python):
d, n = (int(i) for i in input().split())

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

Solution (Python):
def solve(string):
    d, n = map(int, string.split())
    return str(100**d * n) if n < 100 else str(100**d * (n + 1))


if __name__ == '__main__':
    print(solve(input()))

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 D == 0:
    l = [i for i in range(1, 200) if i % 100 != 0]
elif D == 1:
    l = [i for i in range(100, 20000, 100) if i % 10000 != 0]
else:
    l = [i for i in range(10000, 2000000, 10000) if i % 1000000 != 0]
print(l[N - 1])

Solution (Python):
D,N = tuple(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*(100**D))
else:
	print(N*(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())
a = 100 ** a
if b == 100:
  b = 101
  
ans = b * a
print(ans)

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

if(D == 0):
   count = N//100
   print(N + count)
elif(D == 1):
   
   count = N//100
   print(100*(N + count))
elif(D == 2):
   
   count = N//100
   print(10000*(N + count))

Solution (Python):
def ringos_favorite_numbers(D: int, N: int) -> int:
    if N == 100:
        return (N + 1) * (100 ** D)
    return N * (100 ** D)


if __name__ == "__main__":
    D, N = map(int, input().split())
    ans = ringos_favorite_numbers(D, N)
    print(ans)

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

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

Solution (Python):
d, n = map(int, input().split())
cnt = 0
num = 1
while True:
    if num % 100**d == 0 and num / 100**d != 100:
        cnt += 1
    if cnt == n:
        break
    num += 1
print(num)

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

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

Solution (Python):

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

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

Solution (Python):
d,n = map(int,input().split())
num = [100**d*i for i in range(1,n+2)]
print(num[-2] if n<=99 else num[-1])

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

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

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

Solution (Python):
d, n = map(int, input().split())
cnt=1
ans=1
while cnt<n:
    ans+=1
    if ans%100==0:
        continue
    cnt+=1
print(ans*100**d)

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

ans = 0
K, N = map(int, input().split())
if N == 100:
    ans = 100**(K+1)+100**K
else:
    ans = 100**K*N
print(ans)

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:
    w = 100 ** D
    print(w * N)
else:
    w = 100 ** D
    print(w * (N+1))

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*1)
    else:
        print(int(n*1))
elif d==1:
    if n==100:
        print(101*100)
    else:
        print(int(n*100))
elif d==2:
    if n==100:
        print(101*10000)
    else:
        print(int(n*10000))

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 = [int(x) for x in input().split()]
print(100 ** d * n) if ((100 ** d * n) % (100 ** (d + 1)) != 0) else print(100 ** d * (n + 1))

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

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

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

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

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

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

tmp = []
for i in range(1,100):
    tmp.append(i*100**d)
tmp.append(101*100**d)
print(tmp[n-1])

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

Solution (Python):
D,N=(int(i) for i in 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:
    print((n+1)*(100**d))
else:
    print(n*(100**d))

Solution (Python):
D, N = input().split()
if N == "100":
    print("101" + '00' * int(D))
else:
    print(N + '00' * int(D))

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((100**d) * (n + 1))
else:
	print((100**d) * n)

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

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((N+1)*100**D)

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

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

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

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

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

Solution (Python):
import sys

def main():
  input = sys.stdin.readline
  D, N = map(int, input().split())
  if N < 100:
    print((100**D) * N)
  else:
    print((100**D)* (N+1))


if __name__ == '__main__':
  main()

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

print([i * (100 ** d) for i in range(1, 102) if i != 100][n - 1])

Solution (Python):
from sys import stdin
d,n=[int(x) for x in stdin.readline().rstrip().split()]
x=1
for i in range(d):
    x*=100
ans=0
if (n==100):
    n+=1

for i in range(n):
    ans+=x
print(ans)

Solution (Python):
D_N = [int(i) for i in input().split()]
t = 0
q = 100 ** D_N[0]
i = 0


while(D_N[1]):
    i = i+1
    t = t+q
    
    if i == 100:
        print(t + q)
        break

    if i == D_N[1]:
        print(t)
        
        break

Solution (Python):
D, N = [int(x) for x in 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())
if n==100:
  n+=1
print(100**d*n)

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin
D,N=[int(x) for x in stdin.readline().rstrip().split()]
if N%100==0:
  ans=100**D*(N+1)
else:
  if D==0:
      ans=N
  else:
      ans=100**D*N
print(ans)

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

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