peterverebics/CodeNet_Python_118 huggingface dataset:
d, n = map(int, input().split())
s = 0
if d == 0:
  print(n)
  exit()
for i in range(100 ** d, 100 ** (d * 2) + 1, 100 ** d):
  s += 1
  if s == n:
    print(i)
    exit()
d, k = map(int, input().split())

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

if D == 0:
    print(N)
elif D == 1:
    print(N * 100)
else:
    print(N * 10000)
#abc100 b
d,n=map(int,input().split())
ans=n*100**d
print(ans)
D, N = map(int, input().split())
list = []
i = 1

while len(list) < N:
  if D == 2:
    list.append(10000 * i)
    i += 1
    
  elif D == 1:
    list.append(100 * i)
    i += 1
    
  else:
    list.append(i)
    i += 1
    
print(list[-1])
D,N = list(map(int, input().split()))
if D == 0: d = 1
elif D == 1 : d = 100
else: d = 10000

print(N*d)
D, N = map(int,input().split())
z = 0
x = 1
y = 0

if D == 0:
    while z == 0:
        if x % 100 != 0:
            y += 1
            if y == N:
                print(x)
                z += 1
        x += 1
    exit()
while z == 0:
    if x % (100 ** D) == 0:
        y += 1
        if y == N:
            print(x)
            z += 1
    x += 1
d, n = map(int, input().split())
if d == 0 and n == 100:
    print(101)
    exit()
print(100**d * n)
d,n = map(int,input().split())

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

ans = 0
if(D == 0):
  print(N)
else:
  ans = N
  ans = ans * 10 ** (D+2)
  print(ans)
n,d=map(int,input().split())
if n<=99:
    print(100**n*d)
else:
    print(10**n*101)
d, n = map(int,input().split())

if n == 100:
    print(1010000)
else:
    print(100 ** d * n)
a,b=map(int,input().split())
res = 0
if a == 0:
  res = b
elif a == 1:
  res =100*b
elif a == 2:
  res =10000*b
print(res)
D,N=map(int,input().split())
print(100**D*N)
def main():
    D, N = map(int, readline().split())
    if N!=100:
        ans = 100**D * N
    else:
        ans = 100**D*(N+1)
    print(ans)
d, n = map(int, input().split())
print((1000 ** d) * n )
d,n = map(int,input().split())
if n !=100:
  if d !=0:
    print((100**d)*n)
  else:
    print(n)
else:
  print(101*(100*d))
D, N = map(int, input().split())
ans = []
jo = 0
for i in range(1, 1000):
    tmp = (100 ** D) * i
    if tmp // 100 == 100 ** D:
        continue
    else:
        ans.append(tmp)

print(ans[N-1])
d, n = map(int, input().split())
l = []
if d != 0:
    for i in range(1, 102):
        a = 100**d
        l.append(a*i)
    l.sort()
    print(l[n-1])
else :
    print(n)
d, n = map(int, input().split())
count = 0
i = 1
while True:
    if i%100*d==0 and i//(100**d) < 100**d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1
#--------------------------------------------
#ライブラリ呼び出し
import sys
import math
#--------------------------------------------
D, N = map(int, input().split())
 
if D ==100:
    D=101
a=100**D
print(a*N)
D,N=map(int,input().split())
ans=N*(100**D)
if N==100:
  ans+=1
print(ans)
def main():
    D, N = map(int, input().split())
    if D == 0:
        print(N)
    if D == 1:
        print(100 * N)
    if D == 2:
        print(10000 * N)


if __name__ == '__main__':
    main()
def main():
    D, N = map(int, input().split())
    print(pow(100, D) * N)


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

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

if D==0: print(N)
elif D==1: print(100*N)
else: print(10000*N)
D, N = map(int, input().split())
li = [i * 100 ** D for i in range(1, N + 1)]
print(li.pop())
def myAnswer(D:int, N:int) -> int:
   return 100**D * (N - (N - 1)//99)


def modelAnswer():
   tmp=1
def main():
   D,N =map(int,input().split())
   print(myAnswer(D,N))
if __name__ == '__main__':
   main()
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(100001)
  else: 
    print(1000001)
D, N = map(int, input().split())

if D == 0:
  print(N)
elif D == 1:
  print(N * 100)
elif D == 2:
  print(N * 100 ** 2)
d, n = map(int, input().split())
print(100**d+n)
d, n = map(int,input().split())
print(100**d * n)
#template
def inputlist(): return [int(j) for j in input().split()]
from collections import Counter
#template
#issueから始める
D,N = inputlist()
print(str(N)+'0'*2*D)
d,n=map(int,input().split())

print(100**d*n)
d, n = map(int, input().split())
print(str(n) + str(100**d).replace("1", ""))
D, N = map(int, input().split())
print(N*(10**D))
d,n = map(int,input().split())
array = []
for i in range(n):
    array.append((100**d)*(i+1))
print(array[-1])
D,N=map(int,input().split())

if D==0: print(N)
elif D==1: print(100*N)
else: print(200*N)
def solve(D, N):
    ans = 100**D * N

    return ans


if __name__ == "__main__":
    D, N = map(int, input().split())
    print(solve(D, N))
d, n = map(int, input().split())
ans = 0
if d == 0:
    ans = n
if d == 1:
    ans = n*100
if d == 2:
    ans = n*10000
print(ans)
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(101)
elif D == 2 and N < 100:
  print(N * 100 * 100)
elif D == 2 and N == 100:
  print(101)
# coding: utf-8
# Your code here!
d,n=map(int,input().split())
print(100**d*n)
n,d=map(int,input().split())
print(d*10**n)
d, n = map(int, input().split())
print((100 ** d) * n )
D, N = map(int, input().split())
if D == 0:
    print(N)
elif D == 1:
    print(N*100)
elif D == 2:
    print(N*10000)
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(1001000)
    print(n*10000)
def main():
    d, n = map(int, input().split())

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

    print(ans)


if __name__ == "__main__":
    main()
D, N = [int(x) for x in input().split()]

div = 100 ** D

print(div)
print(N * div)
D,N = map(int, input().split())
print(N*100**D)
def main():
    d, n = map(int, input().split())
    div = 100**d
    ans = div*n
    if n == 100:
        ans += 1
    print(ans)


if __name__ == "__main__":
    main()
D,N = map(int, input().split())
if N == 100:
    print(N*(100**D))
else:
    print(101*(100**D))
D_kai, N_ban = map(int, input().split())

begin = 100 ** D_kai
ctr = 0

for i in range(1, 10000):
    if (i % 100 != 0):

        ctr += 1
    
    if (ctr == N_ban):
        ans = begin * ctr
        break

print(ans)
a,b=(int(i) for i in input().strip().split(" "))
print(b*(100**a))
d, n = map(int, input().split())
print(n * 100 ** d)
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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

    print((100**D) * N)


if __name__ == "__main__":
    main()
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

print(100 ** D * N)
D,N=map(int,input().split())
if D==0 :
  print(N)
else :
  print(100**D*N)
D, N = map(int, input().split())
li = [i * 100 ** D for i in range(100)]
print(li[N]) if N != 100 else print(li[N - 1])
d, n = map(int, input().split())
if d == 0:
    print(n)
else:
    print(n * (100 ** d))
a,b = map(int,input().split())
c = 100 ** a

print(c * b)
d, n = map(int, input().split())
ans = (100 ** d) * n
print(ans)
d,n=map(int,input().split())
if d==0:
  print(1*n)
elif d==1:
  print(100*n)
else:
  print(10000*n)
D, N = map(int, input().split())

if D == 0:
    print(N)
elif D == 1:
    print(100 * N)
else:
    print(10000 * N)
import sys

input = sys.stdin.readline

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

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

ans = 100**D * N
print(ans)
d,n=input().split()
ans=n+"00"*int(d)
print(ans)
d, n = map(int,input().split())

result = 0
for i in range(1,n+1):
  if i // 100 == 0:
    result = i*(100**d)
  else:  
    result = i*(100**d)+1

print(result)
a,b=map(int,input().split())

print((100**a)*b)
a=input().split(" ")
d=100**int(a[0])
k=int(a[1])
ans=d*k
print(ans)
#!/usr/bin/env python3

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

if n == 100:
    if d == 0:
        print(100+1)
    elif d == 1:
        print(100*100+1)
    else:
        print(100*1000+1)
else:
    if d == 0:
        print(n)
    else:
        print((100**d)*n)
D,N = (int(X) for X in input().split())
print(N*pow(100,D))
D, N = [int(i) for i in input().split()]

hundreds = [i for i in range(1, 10001) if i % 100 == 0]
tenthousands = [i for i in range(1, 1000001) if i % 10000 == 0]

if D == 0:
    print(N)
elif D == 1:
    print(hundreds[N-1])
else :
    print(tenthousands[N-1])
d, n = map(int,input().split())

print(str(n)+'00'*d)
D, N = map(int, input().split())

print((100**D)*N)
d,n = map(int,input().split())
if d==0:
    print(n)
elif d==1:
    print(n*100)
else:
    print(n*10000)
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

print((100 ** d) * n)
D , N = map(int, input().split())
C = []
if D == 0 :
  for i in range(1,N+5):
    if i%100 != 0 :
      C.append(i)
  print(C[N-1])

if D == 1:
  print(100*N)
    
if D == 2:
  print(10000*N)
d,n = map(int, input().split())
print(1+(100**d)*n if n==100 else (100**d)*n)
D, N = map(int, input().split())
ans=N * (100**D)
print(ans)
d,n = map(int, input().split())
if d == 100:
    print(int(100**d*100+(100**d)))
else:
    print(int((100**d*n)))
p,q= input().split()
a,b =(int(p), int(q))
print(100**a*b)
D, N = map(int, input().split())

if N == 100:
    print(100 ** (D+1) + 1)
else:
    print(100 ** D * N)
import sys
sys.setrecursionlimit(10**6)

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

if d==0:
    print(n)
else:
    print(n*100**d)
D,N = map(int,input().split())
ans = []
jo = 0
for i in range(1,N+1):
    tmp = (100**D)*i
    if tmp // 100 == 100**D:
        jo += 1
    else:
        ans.append(tmp)
print(ans[N-1-jo])
n,k=map(int,input().split())
print(pow(100,n)*k)
import math
def main():
  d,n = list(map(int,input().split()))
  print(pow(100,d)*n)
main()
d, n = map(int, input().split())
 
if d==0:
	print(n)
elif d==1:
	if n<100:
		print(n*100)
	else:
		print(10100)
elif d==2:
	if n<100:
		print(n*10000)
	else:
		print(n*10000+10000)
L, R = map(int,input().split())
print((100**L)*R)
D,N=map(int,input().split())
print(N*(100**D))
D, N = [int(v) for v in input().strip().split(" ")]

print(pow(100, D) * N)
import sys
D,N = map(int,input().split())

if D not in [0,1,2] or not (1 <= N < 100):
    sys.exit()

print(N*(100**D))
d, n = map(int, input().split())

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

print(ans)
from math import floor
D, N = map(int, input().split())
if D == 0:
    print(N)
else:
    print((N-floor((N-1)/99))*100**D)
d, n = map(int, input().split())
d = 100**d
aa = []
    
for i, num in enumerate(range(100)):
    num *= d
    if i==n:
        print(num)
        break
d,n = map(int,input().split())

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

c = pow(100, d)

a = c * n

print(a)
a, b =map(int, input().split())
if a==0:
  result = b
else:
  result = a*100 * b
print(result)
d,n=map(int,input().split())
if d==0:
    print(n)
elif d==1:
    print(100*n)
elif d==2:
    print((100**2)*n)
d, n = map(int, input().split())

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

ten = [1, 100, 10000]

print(ten[d] * n)
D, N = [int(x) for x in input().split()]

div = 100 ** D

print(N * div)
D,N = map(int,input().split())
#0 5
A = [int(i) for i in range(1,101)]
B = [int(i*100) for i in range(1,101)]
C = [int(i*10000) for i in range(1,101)]

if D == 0:
	print(A[N-1])
elif D == 1:
	print(B[N-1])
else:
	print(C[N-1])
import numpy as np
 
d,n = map(int, input().split())
if(not(n==100)):
  if(d==0):
    print(n)
  elif(d==1):
    print(100*d)
  else:
    print(10000*d)
else:
  if(d==0):
    print(101)
  elif(d==1):
    print(10100)
  else:
    print(1000000)
def main(d, n):
    ans = []

    for i in range(n):
        ans.append(100**d * (i + 1))

    print(ans[-1])


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

    main(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())
ans = 100 ** d * n
print(ans)
d,n = map(int, input().split())
if d == 0:
    print(n)
    
elif d == 1:
    print(n*100)
    
elif d == 2:
    print(n*10000)
def main():
    d,n = map(int, input().split())
    if d == 100:
        print(((100**d) * n) + 1)
        sys.exit()
    print((100**d) * n)  
if __name__ == '__main__':
    main()
d,n = list(map(int,input().split()))

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

else:
    if n == 100:
        print(1000000)
    else:
        print(10000*n)
d,n = map(int, input().split())
if(d==0):
    print(100*n)
elif(d==1):
    print(n*100)
else:
    print(n*10000)
d, k = list(map(int, input().split()))
print(k * (100**d))
def formula(d,n ):
    return n*(100**d)
  
d,n = map(int, input().split()) 
    
if(d==0):
    print(n)
else:
    print(formula(d, n))
import sys
input = sys.stdin.readline

# B - Ringo's Favorite Numbers
D, N = map(int, input().split())

print(100 ** D * N)
d,n=map(int,input().split())
if d==0:
    print(n)
elif d==1:
    print(n*100)
else:
    print(n*10000)
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

d, n = nm()

print(100**d * n)
D, N = map(int, input().split())
print((10 ** D) * N)
d,n=map(int,input().split())
n=str(n)
if d==0:
    print(n)
elif d==1:
    print(n+"00")
elif d==2:
    print(n+"0000")
d, n = list(map(int, input().split()))
cnt = 0
i = 1
while True:
  if(i % (100 ** d) == 0):
    cnt += 1
  if(cnt == n):
    print(i)
    exit()
  i += 1
d, n=map(int, input().split())
k=100**d
print(k*n)
d, n = map(int, input().split())
s = 0
if d == 0:
  print(n)
  exit()
for i in range(100 ** d, 100 ** (d + 1), 100 ** d):
  s += 1
  if s == n:
    print(i)
    exit()
D,N=map(int,input().split())
l=[int(pow(100,D)*i) for i in range(1,N+1)]
print(l[N-1])
D,N=map(int,input().split())
if D==0:
    print(N)
if D==1:
    if N==100:
        print(10100)
    else:
        print(100*N)
if D==2:
    if N==100:
        print(1010000)
    else:
        print(10000*(N+1))
d,n=map(int,input().split())
moto=100**d
print(moto*n)
d, n = map(int, input().split())
if d == 0:
    print(n)
    exit()

x = 100 **d
print(x*n)
d,n=map(int,input().split())
ans=n*(100**d)
print(ans)
D, N = map(int, input().split())
if D==0:
    print(N)
else:
    print(N*(100**D))
D, N = map(int, input().split())
if N != 100:
    print(N*100**D)
else:
    print(100**D+1)
D, N = map(int, input().split())
print(N * 10**(2*D))
d,n=map(int,input().split())
l=[]
for i in range(1,n+1):
    l.append(i*100**d)
print(l[-1])
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())
print(100**d*n)
D, N = map(int, input().split())
anslst = [i for i in range(1, 101)]
for i in range(N):
    anslst[i] = anslst[i] * 100 ** D

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

if d == 0:
    if n == 100:
        ans = 101
    else:
        ans = n
elif d == 1:
    if n == 100:
        ans = 10100
    else:
        ans = 100 * n
elif d == 2:
    if n == 100:
        ans = 1000100
    else:    
        ans = 10000 * n

print(ans)
d, n = [int(i) for i in input().split()]
x = 100**d
print(x*n)
D, N = map(int, input().split())

if N < 99:
  print(100**D*N)
elif N == 100:
  print(100**D*101)
D, N = map(int, input().split())
if D == 2:
  print(N*10000)
elif D == 0:
  if N == 100:
    print(101)
  else:
    print(N)
else:
  if N == 100:
    print(10100)
  else:
    print(N*100)
D,N = map(int,input().split())
if D == 0: print(N)
else:
  gen = 100**D
  res = 0
  count = 0
  while (True):
    res += gen
    count2 = 0
    x = res
    while x >= 100:
      x //= 100
      count2 += 1
    if count2 == D: count+=1
    if count==N: break
  print(res)
D, N = map(int, input().split())

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

t = 100**d

print(t*n)
d, n = map(int,input().split())
print(int(str(n) + '00' * d))
D,N = map(int, input().split())
ans = N*100**D
print(ans)
d,n = map(int,input().split())
ans = n * 100**d
print(ans)
d,n=map(int,input().split())
x = (100**d)*n
if d==0 and x%100==0:
  print(x+1)
else:
  print(x)
d, n = map(int, input().split())

# print(100 ** 0)
# print(100 ** 1)
# print(100 ** 2)

start = 100 ** d
# step = 100 ** d
# end 

# print(start * n)

value = start
count = 1
while True:
    if n == count:
        break
    
    value += start
    if d == 0:
        if value % 100 != 0:
            count += 1
    elif d == 1:
        if value % 10000 != 0:
            count += 1
    else:
        count += 1
    
print(value)
A = [1, 100, 10000]
d, n = map(int, input().split())

ans = A[d] * n
print(ans if ans % 100 != 0 else ans + 1)
d, n = map(int, input().split())
num = 100 ** d
print(num * n)
d,n = map(int, input().split())

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

print(100**a*b)
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()
    print((100**a)*b)
if __name__ == '__main__':
    do()
D,N=map(int,input().split())
print(((100**D)*N) if N<100 else print((N+1)*(100**D)))
#!/usr/bin/env python3
d, n = map(int, input().split())
print(n, "00" * d, sep="")
def solve():
    D, N = map(int, input().split())
    print(100 ** D * N)


if __name__ == "__main__":
    solve()
x,y= map(int, input().split())
if x==0:
  print(y)
elif x==1:
  print(y*100)
elif x==2:
  print(y*10000)
def ringo(d , n):

    return n * 100**d

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

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

ans = (100**d)*n
print(ans)
#n=int(input())
d,n=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

add=100**d
total=0

for i in range(n):
    total+=add

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

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

if d == 0:
    print(n)
elif d == 1:
    print(100*n)
else:
    print(10000*n)
def main():
    D, N = map(int, input().split())
    if D == 0:
        print(N)
    elif D == 1:
        print(100*N)
    elif D == 2:
        print(10000*N)
main()
D, N = map(int, input().split())

coef = 100**D
skip = N // 100**(D+1)

print(coef * (N+skip))
import sys
input = sys.stdin.readline

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


if __name__ == '__main__':
    main()
d, k = list(map(int, input().split()))
x = 100 ** d
ans = 0
for i in range(0, (k + 1) * x, x):
    ans = i

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

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

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

if d == 0:
    if n == 100:
        ans = 101
    else:
        ans = n
elif d == 1:
    ans = 100 * n
elif d == 2:
    ans = 10000 * n

print(ans)
# coding: utf-8
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

D, N = lr()
answer = 100 ** D * N
print(answer)
from math import floor
D, N = map(int, input().split())
print((N-floor((N-1)/99))*100**D)
D,N = map(int,input().split())

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

if(d == 0):
    for i in range(1, 101):
        if(i % 100 != 0):
            cnt += 1
            if(cnt == n):
                ans = i
                print(ans)
                break
else:
    for j in range(1, 101):
        ans = 100**d*j
        cnt += 1
        if(cnt == n):
            print(ans)
            break
a, b = list(map(int, input().split()))

ans = 100 ** a * b

print(ans)
D,N = map(int,input().split())
if D == 0:
    print(N)
else:
    lis = ["{}".format(N)]
    for i in range(1,2*D+1):
        lis.append("0")
    print(int("".join(lis)))
def read_ints():
    return[int(i) for i in input().split()]

def main():
    d, n = read_ints()
    print(100 * (100**d) + 1 if n == 100 else (100**d)*n)

if __name__ == '__main__':
    main()
D , N = map(int, input().split())
C = []
if D == 0 :
  for i in range(1,N+100):
    if i%100 != 0 :
      C.append(i)
  print(C[N-1])

if D == 1:
  print(100*N)
    
if D == 2:
  print(10000*N)
d,n=map(int,input().split())

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


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



print(N*number)
D,N=map(int,input().split())
print(str(N)+str(0)*(D*2))
d,n = map(int,input().split())
m = n * 100
l = n * 10000
if(d == 0):
    print(n)
elif(d == 1):
    print(m)
elif(d == 2):
    print(l)
d,n=map(int,input().split())
print(str(n)+str(0)*(d*2))
def resolve():
  d, n = map(int, input().split())
  if d == 0:
    if n == 100:
      print(101)
    else:
      print(n)
    return
  
  if d == 1:
    if n == 100:
      print(10100)
    else:
      print(100 * n)
    return

  if d == 2:
    if n == 100:
      print(1000100)
    else:
      print(10000 * n)
    return

  return

if __name__ == "__main__":
  resolve()
D,N=map(int,input().split(' '))
print(N*(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(1000100)
a = list(map(int,input().split()))

print(100^a[0]*a[1])
D,N = map(int,input().split())

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

cnt = 0
for i in range(1,10**9):
    if i % 100**d == 0: cnt += 1
    if cnt == n:
        print(i)
        break
d,n = map(int,input().split())
ans = 0
if d == 0:
  ans = n
elif d == 1:
  ans = 100 * n
else:
  ans = 10000 * n
print(ans)
import sys
D,N = map(int,input().split())

if D not in [0,1,2] and not (1 <= N <= 100):
    sys.exit()

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

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

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