peterverebics/CodeNet_Python_118 huggingface dataset:
d,n=map(int,input().split())
num=100**d
if n==100:
    print(num*101)
else:
    print(num*n)
a,b = map(int,input().split())
if b == 100:
    print((100**a)*101)
    exit()
print((100**a)*b)
N, D = map(int,input().split())
print(pow(100,N)*D if D != 100 else pow(100,N)*(D+1))
d, n = map(int, input().split())
if n == 100:
    print(100**d*(n+1))
else:
    print(100**d*n)
d, n = map(int, input().split())
if n < 100:
    print(n * 100 ** d)
else:
    print((n + 1) * 100 ** d)
D, N = map(int, input().split())

if N < 100:
  print(100**D*N)
elif N == 100:
  print(100**D*101)
d,n=input().split()
if n=="100":
    n="101"
d=int(d)
for i in range(d):
    n+="00"
print(n)
a,b=map(int, input().split())
if b == 100:
  b += 1
print(b*100**a)
a,b = map(int,input().split())
if b==100:
    b+=1
ans = b*100**a
print(ans)
d,n=map(int, input().split())
print(n*(100**d) if n<100 else 101*(100**d))
d, n = map(int, input().split())
if n == 100:
    n += 1
print(100 ** d * n)
d,n = map(int,input().split())
if n!= 100:
  print(n*(100**d))
else:
  print((n+1)*(100**d))
d,n=map(int,input().split())
if n==100:
    print(100**d*(n+1))
else:
    print(100**d*n)
D, N = list(map(lambda x : int(x), input().split(" ")))
print((N + int(N/100)) * (100 ** D))
d, n = map(int, input().split())
ans = (100 ** d) * n if n != 100 else (100 ** d) * 101
print(ans)
d,n=map(int,input().split())
a=[100**d*i for i in range(n+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(a[-1])
D, N = map(int, input().split())
if N == 100:
    print('101'+D*'00')
else:
    print(str(N)+D*'00')
D, N = map(int, input().split())
'''
q = (N-1)//99
print((100*q + N - 99*q)* 100**D)
'''

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

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

if n == 100:
    n += 1
print(100**d * n)
# abc100_b.py

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

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

print(X)
a, b = map(int, input().split())
dst = str(b) + str(100 ** a)[1:] if a != 0 else str(b)
if b == 100: dst = str(int(dst) + 100 ** a) if a != 0 else str(int(dst) + 1)
print(dst)
a=input();print(int(eval(a[2:5])*1.01)*100**int(a[0]))
D, N = map(int, input().split())

if N <= 99:
    print(N, end = "")
    for _ in range(D):
        print("00", end = "")
    print("")
else:
    if D == 0:
        print(101)
    elif D == 1:
        print(10100)
    else:
        print(1010000)
d,n =map(int,input().split())
if n%100 != 0:
    ans = 100**d*n
else:
    ans = 100**d*101
print(ans)
import numpy as np
D, N = map(int, input().split())

def cnt(n):
    tmp = 0
    n = n*1.0
    while n.is_integer():
        if (n/100.0).is_integer():
            tmp += 1
            n = n / 100.0
        else:
            break
            
    return tmp

coef = 100**D
whole = np.array([i*coef for i in range(1, 150)])
result = np.array(list(map(cnt, whole)))

print(whole[np.where(result==D)][N-1])
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)
import sys
input = sys.stdin.readline

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


if __name__ == '__main__':
    main()
d,n = map(int,input().split())
if n != 100:
    print(100**d*n)
else:
    print(100**d*(n+1))
D, N = map(int, input().split(" "))

print(((100**D)*(N+(N//100))))
def solv(t):
    c = 0
    while t % 100 == 0:
        t /= 100
        c += 1
    return c

D, N = map(int, input().split())
t = 1
c = 0
while c < N:
    n = solv(t)
    if n == D:
        c += 1
    t += 1

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

a = 0  
if N==100: N=101
print(N*pow(100,D) + a)
d, n = map(int, input().split())

ans = (100**d)*n
if n == 100:
  ans += 100**d
print(ans)
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

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

val = 100**D
if N<100:
    print(val*N)
else:
    print(val*N + val)
a,b=map(int,input().split())
if b<100:print((100**a)*b)
if b==100:print((100**a)*(b+1))
d, n = [int(x) for x in input().split()]
gap = 100 ** d
gap_check = gap * 100
count = 0
ans = 0
while True:
    ans += gap
    if ans % gap_check != 0:
        count += 1
        if count >= n:
            break
print(ans)
d,n=map(int,input().split())
if n == 100: n = 101
print(n*10**(2*d))
D, N = map(int, input().split())
if N == 100:
    N += 1
print(N * 100**D)
d, n = map(int, input().split())
def division(x):
    if x % 100 != 0:
        return 0
    else:
        return division(x//100) +1
count= 0
for i in range(1, 1010001):
    if division(i) == d:
        count +=1
    if count == n:
        print(i)
        break
d,n = map(int,input().split())
if n==100: n+=1
if d==0: print(n)
elif d==1: print(100*n)
else: print(10000*n)
d,n=map(int,input().split())
print(n*(100**d) if n<100 else (n+1)*(100**d))
d, n = map(int, input().split())
if n == 100:
    n += 1
print(100**d*n)
d, n = (int(i) for i in input().split())
ans = 100**d
add = ans
for i in range(n-1):
    ans += add
    if ans / (100**d) % 100 == 0:
        ans += add
print(ans)
def calc(x):
    ret = 0
    while x % 100 ==0:
        x /= 100
        ret += 1
    return ret

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

cnt = 0
val = 0

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

print(val)
D, N = map(int,input().split())
if D == 2:
  if N < 100:
    print(N*10000)
  else:
    print(1010000)
elif D == 1:
  if N < 100:
    print(N*100)
  else:
    print(10100)
else:
  if N < 100:
    print(N)
  else:
    print(101)
d,n = map(int,input().split())
if n == 100:
  print(101*100**d)
else:
  print(n*100**d)
d,n = map(int,input().split())

if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
else:
    tmp = 100**d
    if n == 100:
        print(101*tmp)
    else:
        print(tmp*n)
d, k = list(map(int, input().split()))
if k == 100:
    print(101 * (100**d))
else:
    print(k * (100**d))
x, y = map(int,input().split())

if x == 0:
    if y == 100:
        print(101)
    else:
        print(y)
if x == 1:
    if y == 100:
        print(10100)
    else:
        print(y*100)
if x == 2:
    if y == 100:
        print(1010000)
    else:
        print(y*10000)
d,n=map(int,input().split())
if n==100:
  print(100**(d+1)+100**d)
else:
  print(100**d*n)
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b=INTM()
    if b==100:
        b=101
    print((100**a)*b)
if __name__ == '__main__':
    do()
D, N = map(int, input().split())
anslst = [i for i in range(1, 100)]
anslst.append(101)
for i in range(N):
    anslst[i] = anslst[i] * 100 ** D

print(anslst[N - 1])
# coding: utf-8
# Your code here!
d,n=map(int,input().split())
if n==100:
    print(100**d*(n+1))
else:
    print(100**d*n)
d, n = map(int, input().split())
if n != 100:
    print(100**d*n)
else:
    print(100**d*(n+1))
D, N = map(int, input().split())
if N // 100 > 0: N += 1
print(N * 100 ** D)
d, n = list(map(int, input().split()))
print(100**d * n) if n != 100 else print(100**d *(n+1))
D, N = map(int, input().split())
N = N if N != 100 else 101
print(N*(100**D))
D, N = map(int, input().split())

e = 100 ** D
p = 1
while N > 0:
    if p != 100:
        a = e * p
        N -= 1
    p += 1

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

li = []
for i in range(n):
    if i+1 == 100:
        li.append(100**d*(i+2))
    else:
        li.append(100**d*(i+1))

print(li[-1])
d, n = map(int, input().split())

if d == 0:
    if n <= 99:
        print(n)
    else:
        print(101)
elif d == 1:
    if n <= 99:
        print(n*100)
    else:
        print(10100)
elif d == 2:
    if n <= 99:
        print(n*10000)
    else:
        print(1010000)
D, N = map(int, input().split())
if N != 100:
    Ans = N*(100**D)
else:
    Ans = 101*(100**D)
print(Ans)
def main():
    D, N = (int(i) for i in input().split())
    if N == 100:
        N += 1
    print(N * 100**D)


if __name__ == '__main__':
    main()
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)
d, n = map(int, input().split())
if n == 100:
    n = 101
ans = 100 ** d * n
print(ans)
D,N=map(int,input().split())
if N==100 :
  print(100**D*101)
else :
  print(100**D*N)
D, N = map(int, input().split())
if N == 100:
    print(101*(100**D))
else:
    print(N*(100**D))
d, n = map(int, input().split())
if n != 100:
    print(n*100**d)
else:
    print(101*100**d)
D, N = map(int, input().split())
if N < 100:
    print(N * 100 ** D)
else:
    print(101 * 100 ** D)
d, n = map(int, input().split())
if n == 100:
    print((100 ** d) * 101)
else:
    print((100 ** d) * n)
d,n = map(int, input().split())
if n == 100:
    print(str(n+1) + "00"*d)
else:
    print(str(n) + "00"*d)
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])
if n==100:
  print((100**d)*(n+1))
else:
  print((100**d)*n)
d,n = map(int,input().split())

if n == 100:
    n += 1
print(n * 100 ** d)
d, n = map(int, input().split())
start = 100 ** d
counter = 0
while True:
    if start % (100 ** d) == 0 and start % (100 ** (d + 1)) != 0:
        counter += 1
    if counter == n:
        print(start)
        break
    start += 1
d,n=map(int,input().split())
print(n*100**d if n!=100 else 100**(d+1)+100**d)
import sys
input = sys.stdin.readline
D,N = [int(i) for i in input().split()]
ans = (100 ** D) * N
if N == 100 :
    ans +=100 ** D
print(ans)
D, N = map(int, input().split())
if N != 100:
    print(N*(100**D))
else:
    print((N+1)*(100**D))
d,n = map(int,input().split())

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


for i in range(1, 100000000):
    if i % (100 ** d) == 0 and i % (100 * 100 ** d) != 0:
        n -= 1
    if n == 0:
        print(i)
        exit()
D,N = input().split()
D = int(D)
N = int(N)

# D 割る回数
# N 小さい順からN番目
i = 0
count = 0
while(True):
    i = i + 100**D
    if i % 100**D == 0 and i % 100**(D+1) != 0:
        count = count + 1
    if count >= N:
        break
    
print(i)
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)
l = list(map(int, input().split()))
if l[1] != 100:
    print(l[1]*100**l[0])
else:
    print(101*100**l[0])
D,N=map(int, input().split())
base=10**(2*D)
if N!=100:
  print(N*base)
else:
  print((N+1)*base)
D,N = map(int,input().split())

D = 100**D
if N == 100:
    print(N*D+D)
else:
    print(N*D)
import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
d, n = [int(num) for num in lines.pop(0).split(" ")]
if n == 100:
    n += 1
ans = (100 ** d) * n
print(ans)
d, n = map(int, input().split())
if n == 100:
    n = 101
print(n*(100**d))
D, N = map(int, input().split())
print(N*100**D) if N!=100 else print((N+1)*100**D)
d,n = map(int,input().split())
if n != 100:
    print(n*(100**d))
else:
    print((n+1)*(100**d))
d, n = map(int, input().split())
if n != 100:
  print((100 ** d)*n)
else:
  print((100 ** d)*101)
D,N=map(int,input().split())

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

if n < 100:
    print(pow(100, d) * n)
else:
    print(pow(100, d) * 101)
a,b = map(int,input().split())
if b == 100:
    b = 101
print(100 ** a * b)
D, N = map(int, input().split())


def func(x):
    cnt = 0
    while x > 0:
        if x % 100 == 0:
            cnt += 1
        x = x // 100
    return cnt


i = 0
cnt = 0
while True:
    i += 100 ** D
    if func(i) == D:
        cnt += 1

    if cnt == N:
        print(i)
        break
d,n = map(int,input().split())

if n == 100:
  num = 100 ** d * (n+1)
else:
  num = 100 ** d * n
print(num)
MM = input().split()
D = int(MM[0])
N = int(MM[1])
if N ==100:
  ans = 100**D*(N+1)
else:
  ans = 100**D *N
print(ans)
d, n = map(int, input().split())
if n == 100:
    print(101 * 100 ** d)
else:
    print(n * (100 ** d))
#
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""
 
def main():
  a,b = map(int,input().split())
  if b != 100:
    print(100**a*b)
  else:
    print(100**a + b**(a+1))
if __name__ == '__main__':
  main()
D,N=map(int,input().split(' '))
if N != 100:
    print(N*(100**D))
else:
    print((N+1)*(100**D))
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 * 100 * 100)
elif D == 2 and N == 100:
  print(1010000)
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
D, N = M()
i = 100**D
if N < 100:
    print(N*i)
else:
    print(101*i)
d, n = map(int, input().split())
def culc(x):
    if x % 100 != 0:
        return 0
    else:
        cnt = 0
        while x % 100 == 0:
            x //= 100
            cnt +=1
        return cnt            

count = 0

for i in range(1, 1010001):
    if culc(i) == d:
        count += 1
    if count == n:
        print(i)
        break
D, N = map(int, input().split())

if N != 100:
    print(100 ** D * N)
else:
    print(100 ** D * 101)
D,N = list(map(int,input().split()))
count = 0
now = 1
while True:
    tmp = now*100**D
    if tmp%(100**(D+1)) != 0:
        count += 1
    if count == N:
        print(tmp)
        exit()
    now += 1
a,b=map(int,input().split())
if a==0 and b!=100:
    print(b)
elif a==0 and b==100:
    print(101)
elif a==1 and b!=100:
    print(b*100)
elif a==1 and b==100:
    print(10100)
elif a==2 and b!=100:
    print(b*10000)
else:
    print(101*10**4)
d, n = map(int, input().split())

cnt = 0
for i in range(1, 10**7+1):
    if i%(100**d) == 0:
        cnt += 1
    if n == 100:
        if cnt == n+1:
            print(i)
            exit()
    else:
        if cnt == n:
            print(i)
            exit()
D, N = map(int, input().split())
if  D == 0:
    if N == 100:
        print(101)
    else:
        print(N)

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

if D == 2:
    if N == 100:
        print(101*100**2)
    else:
        print(N*100**2)
d, n = map(int, input().split())
print([i*100**d for i in range(1, 102) if i != 100][n - 1])
d,n=map(int,input().split())
print((n+1)*(100**d) if n==100 else n*(100**d))
d, n = map(int, input().split())
print(100**d*(n+(n==100)))
d, n = map(int, input().split())

ten = [1, 100, 10000]

sub = (n - 1) // 99
print(((100 * sub) + n - (99 * sub)) * ten[d])
D,N = map(int,input().split())
if N == 100:
    print(101*100**D)
else:
    print(N*100**D)
d, n = map(int,input().split())
print(100**d *(n+n//100))
D,N=map(int,input().split())

B=100**D
I=0
A=0
while I<N:
    A+=B
    if (A//B)%100:
        I+=1
print(A)
d, n = map(int, input().split())

if n == 100:
  n = 101
print(str(n) + ('00' * d))
D, N = map(int, input().split())
if N<100:
  print(N*(100**D))
else:
  print(101*(100**D))
d,n=map(int,input().split())
if d==0:
	print(n if n<100 else n+1)
else:  
	print(100**d * n if n<100 else 100**d * (n+1))
d,n=list(map(int,input().split()))
print(100**d*(n+n//100))
#!/usr/bin/env python3
import sys

def main():
    D, N = map(int, input().split())
    l = []
    for i in range(1,10000*120):
        if i % (100**D) == 0 and i % (100**(D+1)) != 0:
            l.append(i)
    
    print(l[N-1])

if __name__ == '__main__':
    main()
A,B=map(int,input().split())
if B!=100:
  print(B*(100**A))
else:
  print((B+1)*(100**A))
d, n = map(int, input().split())
if n == 100:
  print(str(101) + ('00' * d))
else:
  print(str(n) + ('00' * d))
import sys
d,n=map(int,input().split())

if d==0:
    if n==100:
        print('101')
    else:
        print(n)
    sys.exit()

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

if n == 100:
    print(100 ** d * n + 100 ** d)
else:
    print(100 ** d * n)
D,N = map(int,input().split())
if N==100:
    N += 1
print(100**D * N)
#!/use/bin/env python3

import math
from collections import defaultdict

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

ans = 0

if d == 0:
    ans = 1
elif d == 1:
    ans = 100
else:
    ans = 10000

ans = 101 * ans if n == 100 else n * ans

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

i = 0
count = 0
beki = 0


if d == 0:
    beki = 1
elif d == 1:
    beki = 100
else:
    beki = 10000


while not count == n:
    i += 1
    if i % 100 == 0:
        continue
    count += 1

print(i * beki)
d,n = map(int,input().rstrip().split(' '))
if n!=100:
	print(n*(100**d))
else:
  	print((n+1)*(100**d))
D,N = map(int,input().split())
print(N*100**D if N != 100 else 101*100**D)
d,n = map(int,input().split())
ans = 0
if d == 0:
  ans = n
elif d == 1:
  ans = 100 * n
else:
  ans = 10000 * n
if n == 100:
  if d == 0:
    ans += 1
  elif d == 1:
    ans += 100
  else:
    ans += 10000
print(ans)
def main():
    d,n = map(int, input().split())

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


if __name__ =='__main__':
    main()
D,N = map(int,input().split())
if N == 100:
  print(10**(2*D)*101)
else:
  print(10**(2*D)*N)
# -*- coding: utf-8 -*-

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

if (100 ** D * N) / 100 != 100 ** D:
    print(100 ** D * N)
else:
    print((100 ** D * N) + (100 ** D))
d,n = map(int, input().split())
if (n != 100):
    print((100**d) * n)
else:
    print((100**d)*101)
D,N=list(map(int, input().split()))
if N==100:
  N+=1
print(100**D*N)
d,n=map(int,input().split())
s=list(range(0,102))
s.pop(-2)
print(s[n]*(100**d))
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+1)*100)
    else:
        print(n*100)
elif d == 2:
    if n == 100:
        print((n+1)*10000)
    else:
        print(n*10000)
D, N =map(int, input().split())
if N != 100:
  print(100**D*N)
else:
  print(100**D*101)
d,n=map(int,input().split())

if n == 100:
    a=101*100**d
else:
    a=100**d*n

print(a)
a,b = map(int,input().split())
c = 100 ** a

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

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

print(ans)
d, n = map(int, input().split())
# d, n = 0, 5
# d, n = 1, 11
# d, n = 2, 85
if n != 100:
    print(100**d*n)
else:
    print(100**d*101)
d,n=map(int,input().split())
if d == 0:
    print(n if n!=100 else "101")
elif d == 1:
    print(n*100 if n!=100 else 10100)
else:
    print(n*10000 if n!=100 else 1010000)
a,b=input().split()
a=int(a)
b=int(b)
if b<100:
  print((100**a)*b)
elif b==100:
  print((100**a)*(b+1))
D,N = map(int,input().split())

if N < 100:
  print((100**D)*N)
else:
  print((100**D)*(N+1))
a,b=map(int,input().split())
if b==100:
  print(101*100**a)
else:
  print(b*100**a)
d, n = map(int,input().split())
print(100**d * n) if n < 100 else print(100**d * (n+1))
d,n = map(int,input().split())
if n==100:
  print((n+1)*(100**d))
else:
  print(n*(100**d))
d,n=map(int,input().split())

if d==0:
  cnt=0
  i=1
  while 1:
    if i%100!=0:
      cnt+=1
    if cnt==n:
      print(i)
      exit()
    i+=1
else:
  cnt=0
  i=1
  waru=100**d
  while 1:
    if i%waru==0 and (i//waru)%100 !=0 :
      cnt+=1
    if cnt==n:
      print(i)
      exit()
    i+=1
d, n = [int(x) for x in input().split()]
if n < 100:
  print(n * 100 ** d)
else:
  print(101 * 100 ** d)
D, N = map(int, input().split())
print([100 ** D * i for i in range(102) if i%100 != 0][N-1])
D, N = map(int, input().split())
print(int(str(N) + '00' * D) if N != 100 else int(str(N + 1) + '00' * D))
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)
a, b = map(int, input().split())
if b != 100:
    print(100**a*b)
else:
    print(100**a*(b+1))
D, N = map(int, input().split())

if N <= 99:
    print(100 ** D * N)
else:
    print(100 ** D * 101)
d, n = map(int, input().split())
start = 100 ** d
counter = 0
while True:
    if start % (100 ** d) == 0 and start % (100 ** (d + 1)) != 0:
        counter += 1
    if counter == n:
        print(start)
        break
    start += 100 ** d
D,N=map(int,input().split())
if N==100:
  ans=(100**D)*(N+1)
else:
  ans=(100**D)*N
print(ans)
D, N = map(int,input().split())
ls = [0]*2000000
for i in range(1,2*10**6):
    if i % 100 == 0:
        ls[i] = 1
    if i % 10000 == 0:
        ls[i] = 2
    if i % 1000000 == 0:
        ls[i] = 3
ii = 0
for i in range(1,2*10**6):
    if ls[i] == D:
        ii += 1
    if ii == N:
        ans = i
        break
print(ans)
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    print(ans)

    return


if __name__ == '__main__':
    main()
d,n=map(int,input().split())
ans=[]
base=100**d
cur=1
if n!=100:
  print(n*base)
else:
  print(101*base)
d,n = map(int,input().split())
print ((100**d)*n) if n != 100 else print ((100**d)*101)
d,n=map(int,input().split())
if n==100:
    ans=101*100**d
else:
    ans=n*100**d
print(ans)
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

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

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

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

if d == 1 and n == 100:
    print("10100")
elif d == 2 and n == 100:
    print("1010000")
elif d == 0 and n == 100:
    print("101")
else:
    print(int(100**d * n))
D,N=map(int, input().split())
if N!=100:
  print((100**D)*(N))
else:
  print((100**D)*(N+1))
# ALC008 C

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

if n == 100:
    print((100 ** d) * n + 100**d)
else:
    print((100 ** d) * n)
def main():
    d, n = map(int, input().split())
    dd = 100**d
    if n%100 != 0:
        ans = n*dd
    else:
        ans = (1+n)*dd
    print(ans)
main()
#!/usr/bin/env python3
import sys

def main():
    D, N = map(int, input().split())
    if N != 100:
        print((100**D)*N)
    else:
        print((100**D)*101)
    return

if __name__ == '__main__':
    main()
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)