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

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

    ans = f(D, N)
    print(ans)


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

    if D == 0:
        ans = N
        if N == 100:
            ans = 101
    elif D == 1:
        xs = range(100, 100 * 101, 100)
        ans = xs[N-1]
    else:
        
        xs = range(100**2, (100 ** 2) * 101, 100**2)
        ans = xs[N-1]

    print(ans)


def f(D, N):
    xs = range(100**D, (100 ** D) * 102, 100**D)
    ans = xs[N-1]
    a = ans // (100**D)
    if a >= 100 and a % 100 == 0:
        ans = xs[N]

    return ans


if __name__ == '__main__':
    main()

Solution (Python):


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

a = 0
if d == 0:
    a = n
    if n == 100:
        a += 1
elif d == 1:
    a = 100 * n
    if n == 100:
        a += 100
elif d == 2:
    a = 100 * 100 * n
    if n == 100:
        a += 100 * 100

print(a)

Solution (Python):
x,y = map(int,input().split())
ans = 0
num = 100**x
for i in range(1,y+1):
    if(num*i != 100**(x+1)):
        ans = num*i
    else:
        ans = num*(i+1)
        i +=1
if(y == 0):
    ans = num
print(ans)

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

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

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

if a[0] == 0:
    if a[1] == 100:
        print(101)
    else:
        print(a[1])
elif a[0] == 1:
    if a[1] == 100:
        print(10100)
    else:
        print(a[1]*100)
elif a[0] == 2:
    if a[1] == 100:
        print(1010000)
    else:
        print(a[1]*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 = [int(i) for i in 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())
res = 0

if D == 0:
    for i in range(N):
        res += 1
elif D == 1:
    for i in range(N):
        res += 100
elif D == 2:
    for i in range(N):
        res += 10000

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

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

if N == 100:
    print(pow(100, D) * 100 + pow(100, D))
    exit()
print(pow(100, D) * N)

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

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

Solution (Python):

DN = list(int(i) for i in input().split())

if DN[1] < 100:
    ans = 100**DN[0]*DN[1]
if DN[1] == 100:
    ans = 100**DN[0]*(DN[1]+1)

print(ans)

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

print(ans)

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

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

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

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

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

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

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


if D == 0:
    tmp = 1
elif D == 1:
    tmp = 100
else:
    tmp = 10000
    
if N < 100:
    print(tmp*N)
else:
    print(tmp*(N+1))

Solution (Python):




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

    n = 100 ** D
    ANS = n * N
    if N == 100:
        ANS += n
    print(ANS)


if __name__ == '__main__':
    main()

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


print(m())

Solution (Python):
D, N = map(int, input().split())
if N == 100:
    ans = pow(100,D) * 101
else :
     ans = pow(100,D) * N
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())
ans = N
for i in range(D):
    ans *= 100
if N == 100:
    ans += 100 ** D
print(ans)

Solution (Python):
s=input().split()
a,b=int(s[0]),int(s[1])
if b==100:
 b+=1
print(100**a*b)

Solution (Python):


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

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

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

elif N == 100:
    if D == 0:
        print(ans * N +1)
    elif D == 1:
        print(ans * N * 100 +100)
    else:
        print(ans * N * 10000 +10000)

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):
l = map(int, raw_input().split())
d = l[0]
n = l[1]

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

Solution (Python):
input_line = input().split()
target_divide = int(input_line[0])
num_target = int(input_line[1])

if target_divide == 0:
    counter = 0
    current_num = 0
    while counter < num_target:
        current_num += 1
        if current_num % 100 == 0:
            continue
        else:
            counter += 1

    print(str(current_num))
    exit(0)

elif target_divide == 1:
    counter = 0
    current_num = 0
    while counter < num_target:
        current_num += 100
        if current_num % 10000 != 0 and current_num % 1000000 != 0:
            counter += 1

    print(str(current_num))

else:
    counter = 0
    current_num = 0
    while counter < num_target:
        current_num += 10000
        if current_num % 1000000 != 0:
            counter += 1

    print(str(current_num))

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

else:
	print(pow(100,d[0])*d[1])

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

list_ = []
for k in range(1, 101):
    str_ = str(k) + "00"*D
    int_ = int(str_)
    list_.append(int_)

if N == 100 and D == 0:
    print(101)
elif N == 100 and D == 1:
    print(10100)
elif N == 100 and D == 2:
    print(1010000)
else:
    print(list_[N-1])

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

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

ans = 100 ** d * n

if n == 100:
  ans += 100 ** d

print(ans)

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

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

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

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

Solution (Python):
from sys import stdin, stdout
from math import sqrt
from collections import defaultdict


D, N = [int(x) for x in stdin.readline().strip().split()]
D = 100 ** D
print(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 = map(int, input().split())
ex = [101, 10100, 1010000]
if n == 100:
    print(ex[d])
else:
    print(pow(100, d) * n)

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

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

Solution (Python):
l = input().split()
D=int(l[0])
N=int(l[1])
if N==100:
    N=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())
s=str(n)
if n!=100:
  s+="0"*(2*d)
  print(int(s))
else:
  t="101"+"0"*(2*d)
  print(int(t))

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

ans = [pow(100, D) * i for i in range(1,200) if pow(100, D) * i % pow(100, D+1) != 0]
print(ans[N-1])

Solution (Python):
from collections import deque
import sys

def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [D, N] = [int(input_raw[0]), int(input_raw[1])]
    if N != 100:
        print (100**D)*N
    else:
        print (100**D)*N + 100**D

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
D,N = map(int,input().split())
cnt = 0
res = 0
dif = 100 ** D
while 1:
    res += dif
    if res % 100**(D+1):
        cnt += 1
    if cnt == N:
        print(res)
        break

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

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

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

Solution (Python):
import math
[a, b] = map(int, input().split())
if b == 100:
    print(int(101 * math.pow(100,a)))
else:
    print(int(b * math.pow(100, a)))

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

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

Solution (Python):
if __name__ == '__main__':
    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)
    elif n==100:
        print(n+1)
if d==1:
    if n<100:
        sub=n*100
    elif n==100:
        sub=(n+1)*100
    print(sub)
if d==2:
    if n<100:
        sub2=n*10000
    elif n==100:
        sub2=(n+1)*10000
    print(sub2)

Solution (Python):
list=input().rstrip().split() 
D=int(list[0]) 
N=int(list[1])
if N!=100:
    print((100**D)*N)
else:
    print(101*(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):

A, B = map(int, input().split())

if A == 0:
    if B == 100:
        print(101)
    else:
     print(B)
elif B == 100:
    print(101*100**A)

else:
    print(B * 100 ** A)

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
D, N = map(int, input().split())
if N != 100:
    print(str(N) + "00" * D)
else:
    print("101" + "00" * 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(x) for x in input().split())
if n == 100:
    n = 101
print('{0}{1}'.format(n, '00' * d))

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)
else:
    if D == 0:
        print(101)
    elif D == 1:
        print(10100)
    else:
        print(1010000)

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

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

if N == 100:
  N = 101

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

Solution (Python):
d,n=map(int,input().split())
if d==0:
    c=0
    a=0
    while c<n:
        a+=1
        if a%100!=0:
            c+=1
elif d==1:
    c=0
    a=0
    while c<n:
        a+=100
        if a%10000!=0:
            c+=1
else:
    c=0
    a=0
    while c<n:
        a+=10000
        if a%1000000!=0:
            c+=1
print(a)

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

Solution (Python):
from sys import stdin

D, N = map(int, stdin.readline().rstrip().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 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(N * (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 d==0:
    if n <100:
        print(n)
    else:
        print(101)
if d==1:
    if n<100:
        print(100**d*n)
    else:
        print(10100)
if d==2:
    if n<100:
        print(100**d*n)
    else:
        print(100**3+100**2)

Solution (Python):
D, N = map(int, input().split())
base = 1
for j in range(D):
    base *= 100
if N%100 == 0:
    N += 1
if(D!=0):
    num = base * N
    print(str(num))
else:
    print(str(N))

Solution (Python):
Data = input()

import re

Shift = re.split(" ",Data)
D = int(Shift[0])
N = int(Shift[1])

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

Solution (Python):

"""
Created on Sat Jun 16 20:49:48 2018
ABC100B
@author: maezawa
"""



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

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

if D==0: a=1
else: a=100**D

if N==100:
	print a*N+a
else:
	print a*N

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

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

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

Solution (Python):
inp = input().split()

for i in range(len(inp)):
    inp[i] = int(inp[i])

d = inp[0]
n = inp[1]

ds = 100**d

if n<100:
    print(ds*n)
elif n==100:
    print(ds*101)

Solution (Python):

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

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

    elif D == 1:
        print(100 * 101)

    else:
        print(10000 * 101)

else:
    if D == 0:
        print(N)

    elif D == 1:
        print(100*N)

    else:
        print(10000*N)

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

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

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

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

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

    elif D == 1:
        print(100 * 101)

    else:
        print(10000 * 101)

else:
    if D == 0:
        print(N)

    elif D == 1:
        print(100*N)

    else:
        print(10000*N)

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

Solution (Python):
D, N = map(int, input().split())
ans = 0
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:
    print((100**D)*N)
else:
    print(((100**D)*100)+100**D)

Solution (Python):
D, N = map(int, input().split())
cnt = 0
for n in range(1, 10**7):
    d = 0
    on = n
    while True:
        if n % 100 == 0:
            d += 1
            n /= 100
        else:
            break
    if d == D:
        cnt += 1
        if cnt == N:
            print(int(on))
            break

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())
a = []
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(10000*101)
    else:
        print(10000*N)

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

Solution (Python):

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

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

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

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:
	M = 101
else:
	M = N

if D == 0:
	print(M)
else:
	print(pow(100, D) * M)

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

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())
l1 = []
l2 = []


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

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

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

Solution (Python):




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

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

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

if n == 100:
    n += 1

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

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

start = pow(n, d)

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

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

cnt = 0
for i in range(1, n+1):
    cnt+=1
    if i % 100 == 0 and i // 100 >= 1:
        cnt+=1
print(pow(100, d)*cnt)

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

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

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

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

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

Solution (Python):
l = raw_input().split()

D = l[0]
N = l[1]

a = 100**int(D)
b = int(N)//100
c = int(N)+b

print a*c

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

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

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

if n == 100:
	if d == 0:
		print(101)
	elif d == 1:
		print(10100)
	else:
		print(1010000)

else:
	print(n * (100 ** d))

Solution (Python):
ui = input()

D, N = int(ui.split()[0]), int(ui.split()[1])

print(100**D*(N + int(N/100)))

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

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

    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)

if __name__ == "__main__":
        main()

Solution (Python):
D, N = [int(w) for w in input().split()]
if N == 100:
    N += 1

print(N * (100 ** D))

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

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

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

Solution (Python):
iD, iN = map(int, input().split())

unit = 100 ** iD
if iN < 100:
    result = unit * iN
else:
    result = unit * (iN + 1)

print (result)

Solution (Python):


import os
import sys


def solution(D, N):
    res = str(N) if N<100 else str(N+1)
    for i in range(D):
        res += "00"
    return res
    
if __name__ == '__main__':
    bnm = raw_input().split()
    D = int(bnm[0])
    N = int(bnm[1])
    result = solution(D,N)

    print str(result)

Solution (Python):


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

output = 0
counter = 1
if(D == 0):
    while(counter <= N):
        if(counter % 100 == 0):
            output += 2
            counter += 1
        else:
            output += 1
            counter += 1
elif(D == 1):
    if(N == 100):
        output = 100 * (N+1)
    else:
        output = 100 * N
else:
    if(N == 100):
        output = 10000 * (N+1)
    else:
        output = 10000 * N


print(output)

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

base = 100 ** D

if N == 100:
    ans = base * (N + 1)
else:
    ans = base * N

print(ans)

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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(D, N):
    if N == 100:
        N += 1
    if D == 0:
        return N

    return N * (100**D)


def main():
    D, N = read_int_n()
    print(slv(D, N))


if __name__ == '__main__':
    main()

Solution (Python):
n, k = map(int , input().split())
if k==100:
    print((k+1)* (100)**n)
else:
    print((k)* (100)**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(e) for e in input().split()]
if d == 0:
    ge = int(n / 100)
    print(n + ge)
elif d == 1:
    ge = int(n / 100)
    print((n + ge) * 100)
elif d == 2:
    ge = int(n / 100)
    print((ge + n) * 10000)

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

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

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

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

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

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


print(result)

Solution (Python):
import sys,collections,math;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
 
d,n = Is()
if n == 100:
    n += 1
print(n*(100**d))

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

x = 100 ** d

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

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