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:
    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=map(int,input().split())

sabun=int(n/100)

print(100**d*(n+sabun))

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

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

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

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

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

Solution (Python):
class Solver(object):
    def __init__(self):
        self.d, self.n = list(map(int, input().split(" ")))

    def solve(self):
        if self.n % 100 == 0:
            self.n += 1
        if self.d == 0:
            print(self.n)
        elif self.d == 1:
            print("{}00".format(self.n))
        else:  
            print("{}0000".format(self.n))


if __name__ == "__main__":
    s = Solver()
    s.solve()

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

Solution (Python):

"""
Created on Tue Feb 12 15:50:41 2019

@author: shinjisu
"""


import math


def getInt(): return int(input())


def getIntList(): return [int(x) for x in input().split()]


def zeros(n): return [0]*n


def dmp(x):
    global debug
    if debug:
        print(x)



def abc100b():
    D, N = getIntList()
    if N % 100 == 0:
        return (N+1) * 100**D  
    else:
        return N * 100**D  


debug = False  
print(abc100b())

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

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

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

Solution (Python):
d,n = list(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())
if n != 100:
    print(100 ** d * n)
else:
    print(100 ** d * (n + 1))

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

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

Solution (Python):
D,N = map(int,input().split())
if D == 0 and N == 100:
    print(101)
    exit()
if D == 1 and N == 100:
    print(10100)
    exit()

if D == 2 and N == 100:
    print(1010000)
    exit()

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

Solution (Python):
from statistics import mean, median,variance,stdev
import sys
import math
import fractions

def j(q):
    if q==1: print("AC")
    else:print("WA")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())


d,n= (int(i) for i 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(N == 100):
  N = 101
print((100**D)*N)

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

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

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

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

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

Solution (Python):


import copy
import numpy as np
import random



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

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

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

print(ans)

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


main()

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

'''
better way
d, n = map(int, input().split())
print(100 ** d * (101 if n == 100 else n))
'''

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

n = 100 ** D

if  N != 100:
  answer = n * N
else:
  answer = n * (N + 1)

print(answer)

Solution (Python):
D, N = map(int, input().split())
i = 0
ans = 0
x = 100**D
c = 0
while True:
    if (i * x) % (x*100) != 0:
        ans += 1
        c += 1
        if c >= N:
            break
    i += 1
print(100**D*i)

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

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

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

if D == 0:
  if N != 100:
    print(N*1)
  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(101*10000)

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

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

Solution (Python):
""" AtCoder """

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

ans = 0

for _ in range(N):
    ans += 100**D

if N == 100:
    ans += 100**D

print(ans)

Solution (Python):
def func(x):
    c = 0
    n = x
    while True:
        if n < 100:
            break
        if n % 100 != 0:
            break
        n = n // 100
        c += 1
    return c


def main():
    d, n = map(int, input().split())

    i = 1
    count = 0
    
    
    
    
    
    
    while True:
        if func(i) == d:
            count += 1
        if count == n:
            break
        i += 1
    print(i)


if __name__ == '__main__':
    main()

Solution (Python):
def func(x):
    c = 0
    n = x
    while True:
        if n < 100:
            break

        if n % 100 == 0:
            c += 1
            n = n // 100
        else:
            break
    return c


def main():
    d, n = map(int, input().split())

    i = 1
    count = 0
    if d == 0:
        while True:
            if i % 100 != 0:
                count += 1
            if count == n:
                break
            i += 1
    else:
        while True:
            if i % 100 == 0 and func(i) == d:
                count += 1
            if count == n:
                break
            i += 1
    print(i)


if __name__ == '__main__':
    main()

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

Solution (Python):

base = [ 100**i//100 for i in range(1,4) ]


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

print( base[d]*n + n//(100)*base[d] )

Solution (Python):
d,n=map(int,input().split())
if n==100:
  if d==0:
    print(101)
    exit()
  elif d==1:
    print(10100)
    exit()
  else:
    print(1010000)
    exit()
print(pow(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())

def chk(n):
    for _ in [0]*D:
        if n % 100 == 0:
            n //= 100
            continue
        else:
            return False
    if n % 100 == 0: return False
    else: return True

i = 0
cnt = 0
while cnt < N:
    i += 1
    if chk(i):
        cnt += 1

print(i)

Solution (Python):


def main():
    na = list(map(int, input().split()))
    D, N = na[0], na[1]

    n = N
    if n == 100:
        n = 101

    print((100 ** D) * n)


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
d, n = map(int, input().split())
res = [i * (100**d) for i in range(1,200) if i%100!=0]
print(res[n-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 = (int(x) for x in input().split())

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

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

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

Solution (Python):

import sys
input = sys.stdin.readline

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

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

Solution (Python):
D, N = [int(x) for x in input().split()]
d = 100**D
if N==100:
    print(d * (N+1))
else:
    print(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())
count = 0
i = 1
l = []
while count < N+1:
    l.append(pow(100, D) * i)
    count += 1
    i += 1
if N != 100:
    print(l[N-1])
else:
    print(l[N])

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

Solution (Python):



def main():
    d, n = map(int, input().split())

    if n == 100:
        n += 1

    print(100 ** d * n)


if __name__ == '__main__':
    main()

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

q=int((N-1)/99)

print((100*q+N-99*q)*(100**D))

Solution (Python):
a = [int(i) for i in input().split()] 
if a[0] == 0:
 ans = a[1]
elif a[0] == 1:
 ans = 100*a[1]
else:
 ans =10000*a[1]
if a[1] == 100:
 ans += pow(100, a[0])
     
print(ans)

Solution (Python):



def main():
    """Function."""
    d, n = map(int, input().split())

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


if __name__ == "__main__":
    main()

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


if __name__ == '__main__':
    main()

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

Solution (Python):
d,n = map(int, input().split())
r = 100 ** d
l = [i for i in range(0, r*100, r)]
if n == 100:
    print(100 ** (d + 1) + 100 ** d)
else:
    print(l[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())

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

cnt = 0
val = 0
while cnt < N:
    val += 1
    if calc(val) == D:
        cnt += 1

print(val)

Solution (Python):
d, n = map(int, input().split())
print([n,101][n == 100],end='')
print('00'*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:
  N += 1
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(100*n)
else:
    if n == 100:
        print(1010000)
    else:
        print(10000*n)

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

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())

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

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

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


abc100_b()

Solution (Python):
num = input().split(' ')
D = int(num[0])
N = int(num[1])
if N == 100:
    N = 101
if D == 0:
    print(N)
elif D == 1 or 2:
    print(N * pow(100,D))

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

Solution (Python):
import math
input_lines = input()
num1 =int(input_lines.split(" ")[0])
num2 =int(input_lines.split(" ")[1])

if num1==0 and num2 ==100:
    print(101)
elif num1 ==1 and num2 ==100:
    print(10100)
elif num1 ==2 and num2 ==100:
    print(1010000)    
else:
    print(int(num2*math.pow(100,num1)))

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

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

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

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

Solution (Python):
d,n = list(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 += 1
ans = N * (100 ** D)
print(ans)

Solution (Python):
D,N = list(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(101*(100**D))
else:
  print(N*(100**D))

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

c=[]
for i in range(1,102):
	c.append(i*100**a)
if b!=100:
	print(c[b-1])
else:
	print(c[b])

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

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

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

Solution (Python):
dn = list(map(int, input().split()))
d = dn[0]
n = dn[1]
if n != 100:
    print(100 ** d * n)
else:
    print(100 ** d * 101)

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

Solution (Python):
D, N = [int(_) for _ in input().split()]
print((100 * ((N - 1) // 99) + (N - 1) % 99 + 1) * 100 ** D)

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

Solution (Python):
d, n = map(int,input().split())
inc, c = 100 ** d, 0
i = 0 
if n == 100:
    n = 101
while c < n:
    c += 1
    i = i + inc
print(i)

Solution (Python):
D, N = map(int, input().split())
a = N // 100
b = (N-1) % 99 + 1
print((100*a+b)*(100**D))

Solution (Python):
d,n = input().split()
d=int(d)
n=int(n)
if d==0:
    x=1
    a=[]
    for i in range(101):
        if not x==100:
            a.append(x)
        x+=1
    print(a[n-1])

if d==1:
    y=100
    b=[]
    for j in range(101):
        if not y==10000:
            b.append(y)
        y+=100
    print(b[n-1])

if d==2:
    c=[]
    z=10000
    for k in range(101):
        if not z==1000000:
            c.append(z)
        z+=10000
    print(c[n-1])

Solution (Python):
def ok(i, D):
    for n in range(D):
        if i == 0 or i % 100 != 0:
            return False
        i = int(i / 100)
    if i % 100 != 0:
        return True
    return False


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

i = 1
count = 0
while count < N:
    
    if ok(i, D):
        count += 1
    i += 1
print(i - 1)

Solution (Python):
def right(n, D):
    for i in range(D):
        if n == 0 or n % 100 != 0:
            return False
        n = int(n / 100)
    if n % 100 == 0:
        return False
    return True


D, N = map(int, input().split())
count = 0
i = 0
while count < N:
    if right(i, D):
        count += 1
    i += 1
print(i - 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(N * 100)
    else:
        print(N * 100 + 100)
else:
    if N < 100:
        print(N * 10000)
    else:
        print(N * 10000 + 10000)

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

sys.setrecursionlimit(10**5)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

d,n = li()

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

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

L = []

for i in range(N*2) :
    l = 100**D
    l *= (i+1)
    if D == 0 :
        if (l % 100) != 0 :
            L.append(l)
    elif D == 1 :
        if (l % 10000) != 0 :
            L.append(l)
    else :
        if (l % 1000000) != 0 :
            L.append(l)
ans = L[N-1]
print(ans)

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

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

print(res)

Solution (Python):
D,N = (int(i) for i in input().split())

if D == 0:
    mult = 1
elif D == 1:
    mult = 100
else:
    mult = 10000
    
if N == 100:
    ans = mult*(N + 1)
else:
    ans = mult*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 d == 0:
    ans = n if n != 100 else 101
else:
    ans = 100**d*n if n != 100 else 100**d*(n+1)
print(ans)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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):
D,N = map(int,input().split())
if N == 100:N += 1
print(N*(100**D))

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

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

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

ans = 1

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

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(i) for i in input().split()]
if N==100:
    if D==0:
        print(N+1)
    elif D==1:
        print(100**2+100)
    else:
        print(100**3+100**2)

else:
    if D==0:
        print(N)
    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 = [int(x) for x in input().split()]
ans = N * (max(1, 100 ** D))
if N == 100:
    ans += ans // 100
print(ans)

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

Solution (Python):
d, n = [int(v) for v 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 = 101
print(n * 100 ** d)

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

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

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

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

Solution (Python):
from sys import stdin

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

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

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

Solution (Python):
"""
B - Ringo's Favorite Numbers
"""
d, k = map(int, input().split())

if k == 100:
    k = 101

base = 100 ** d
ans = base * k

print(ans)

Solution (Python):

"""
B - Ringo's Favorite Numbers
https://abc100.contest.atcoder.jp/tasks/abc100_b

"""
import sys
from sys import stdin
input = stdin.readline

Divs = [[], [], []]
for i in range(1, 1100000):
    num = i
    d = 0
    while num % 100 == 0:
        d += 1
        num //= 100
    if d <= 2:
        Divs[d].append(i)

def solve(D, N):
    return Divs[D][N-1]


def main(args):
    D, N = map(int, input().split())
    ans = solve(D, N)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[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('10100')
else:
  if (N != 100):
    print(10000*N)
  else:
    print('1010000')

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

if N == 100:
    N += 1
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())
print((n+n//100)*100**d)

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

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

    cnt = 0
    val = 0

    while cnt != N:
        val += 1
        if calc(val) == D:
            cnt += 1

    print(val)

main()

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

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

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

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

Solution (Python):
a = list(map(int, input().split()))
D = a[0]
N = a[1]

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

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

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

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):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(input())
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

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

Solution (Python):



def inpl(): return list(map(int, input().split()))


a, b = inpl()

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

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())

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

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