peterverebics/CodeNet_Python_118 huggingface dataset:
D, N = map(int, input().split())

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

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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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


if __name__ == '__main__':
    main()
D, N = map(int, input().split())
ans = N*100**D
if N == 100:
  ans = 101*100**D
print(ans)
d, n = map(int, input().split())
if n == 100:
    print(101 * 100**d)
else:
    print(n * 100**d)
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
from decimal import *


def lcm(x, y):
    return (x * y) // math.gcd(x, y)


if __name__ == '__main__':
    b, c = map(int, input().split())
    ans = 0
    if c == 100:
        ans =(100 **b)*(c+1)
    else:
        ans =(100 **b)*c
    print(ans)
d,n=map(int,input().split())
# # nは1<=n<=100

s=1
if d==1:
    s=100
elif d==2:
    s=10000

if s==1:
    ans=[i for i in range(1,100)]
    ans.append(101)
elif s==100:
    ans=[100*i for i in range(1,100)]
    ans.append(10100)

else:
    ans=[10000*i for i in range(1,100)]
    ans.append(1010000)

print(ans[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)
d, n = map(int, input().split())

if n == 100:
  print(100 ** d * (n + 1))
else:
  print(100 ** d * n)
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)
else:
    if n == 100:
        print(100**d * 101)
    else:
        print(100**d * n)
D,N=map(int,input().split())
temp=100**D
if N<=99:
  print(temp*N)
else:
  print(temp*101)
x,y=list(map(int, input().split()))
if y==100:
	y=y+1
print((100**x)*y)
d, n = map(int, input().split())
n += n==100
print((100**d) * n)
def main():
    D, N = map(int, input().split())

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


if __name__ == "__main__":
    main()
d,n=map(int,input().split())
if d==0:
    if n!=100:
        print(n)
    else:
        print(101)
elif d==1:
    if n!=100:
        print(100*n)
    else:
        print(100*101)
elif d==2:
    if n!=100:
        print(10000*n)
    else:
        print(10000*101)
a,b=map(int,input().split())
if b==100:
  b+=1
for i in range(a):
  b*=100
print(b)
D, N = map(int, input().split())

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

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

print(n*100**d)
d, n = map(int, input().split())
print(n * (100 ** d))
d,n =map(int,input().split())
if n%100 != 0:
    ans = 10**d*n
else:
    ans = 10**d*n+1
print(ans)
# 問題文の意味はわからんけど（ちょうど1回、ちょうど2回割り切れる？？？？は？？？？？？？？）サンプルを適当に読む
d, n = map(int, input().split())
if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    print(n * 100)
else:
    print(n * 10000)
d, n = map(int, input().split())

if d == 0:
    print(n)
elif d == 1:
    if n == 100:
        print((n+1)*100)
    else:
        print(n*100)
elif d == 2:
    print(n*10000)
D,N = map(int,input().split())
if D == 0:
  print(N)
else:
  print(100**D*N)
D, N = map(int, input().split())
if D == 0 or D % 100 != 0:
  ans = 100 ** D * N
else:
  ans = 100 ** D * (N+1)
print(ans)
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

d,n = iim()
num = 0
for i in range(n):
    num += 100**d
print(num)
# -*- coding: utf-8 -*-

D,N = list(map(int, input().rstrip().split()))
#-----

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

print(ans)
D,N=map(int, input().split())
base=10**(2*D)
print(N*base)
D,N=map(int,input().split())
print(N*100**D)
#!/usr/bin/env python3
import sys

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

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

cnt = 0
num = 1
while True:
    tmp = num
    flag = True
    for _ in range(D):
        if tmp % 100 == 0:
            tmp //= 100
        else:
            flag = False
    if flag:
        cnt += 1
    if cnt == N:
        break
    num += 1

print(num)
d,n = map(int, raw_input().split())
print n * (100 ** d)
def solve():
    D, N = [int(i) for i in input().split()]
    print(f"{N}{'00' * D}")

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

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

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

ans = (N+1)*10**(2*D)

print(ans)
def resolve():
	d, n = map(int, input().split())
	print(100**d*n+n//100)
resolve()
n,d = list(map(int,input().split()))

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

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

print((100**D) * N)
d,n = map(int,input().split())
print(n*(100**d))
i = list(map(int,input().split()))
num = 100 ** i[0]
print(num * i[1])
D,N = map(int,input().split())
if D == 0:
    if N != 100:
        print(N)
    else:
        print(101)
    exit()
if D == 1:
    if N != 100:
        print(N*100)
    else:
        print(10100)
    exit()
if N != 100:
    print(N*10000)
else:
    print(100010000)
d, n = map(int,input().split())

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

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

print(int(100**d *n))
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 = map(int, input().split())

r = 100**d
print(r*n)
D,N = map(int,input().split())
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())
if n%100 != 0:
    ans = 10**d*n
else:
    ans = 10**d*101
print(ans)
D, N = map(int, input().split())
list = []
i = 1

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

if D == 0:
    print(N)
else:
    q = (N-1)&99
    print((N-q)*(100**D))
d,n=map(int,input().split())
if d==0:
    print(n)
else:
    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())

if d == 0:
  print(n)
elif d == 1:
  print(100*n)
else:
  print(1000*n)
s = input().split()

d = int(s[0])
n = int(s[1])

answer = 0

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

print(answer)
def main():
    d, n = map(int, input().split())
    div = 100**d
    ans = div*n
    print(ans)


if __name__ == "__main__":
    main()
d,n = map(int,input().split())
print(n*100**d)
N,C = map(int,input().split(' '))

print((100 ** N) * C)
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(N)
elif D == 2 and N < 100:
  print(N * 100 * 100)
elif D == 2 and N == 100:
  print(N)
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:
  ans += n
print(ans)
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(int(str(n) + str(100**d).replace("1", "")))
d, n = map(int, input().split())
print(n*(10**(2*d)))
# import math
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque

# import numpy as np
# import scipy as scp

# 入力の受け取り
d,n = map(int,input().split())
if d ==0:
    if n <=99:
        ans = n
    elif n==100:
        ans = 101
elif d == 1:
    if n <=99:
        ans = n*100
    elif n==100:
        ans = 100*100+1
else:
    if n <=99:
        ans = n*100**2
    elif n==100:
        ans = 100*100**2+1

print(ans)
d,n=map(int,input().split())
print(100**d*n)
def main():
    import sys
    input = sys.stdin.readline
    D, N = map(int, input().split())
    if N != 100:
        print(N, end="")
        for i in range(D):
            print("00", end="")
        print("")
    else:
        print(100 ** (D+1) + 1)

if __name__ == '__main__':
    main()
def main():
    d,n=map(int,input().split())
    print(100**d*(n))
    
if __name__ == "__main__":
    main()
L, R = map(int,input().split())
print((100**L)*int((R-1)/99)+R)
d,n = map(int,input().split())
print((100)**d*n)
d, n = map(int, input().split())
if n == 100:
    print(99 * 100 ** d)
else:
    print(n * 100 ** d)
# AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers

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

L=[]

for i in range (1,105):
    n=i*100**D
    L.append(n)

print(L[N-1])
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():

    d,n=map(int,input().split())
    val=100**d
    if d==0 and n==100:
        print(101)
    elif d==1 and n==100:
        print(10100)
    elif d == 2 and n == 100:
        print(10010000)

    else:

        print(val*n)

resolve()
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 1000100)
D, N = map(int, input().split())
print(N * (100**D))
def resolve():
    D, N = [int(i) for i in input().split()]
    if D == 0:
        print(N + (N) // 100)
        return
    print(100**D * N)


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

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

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

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

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

div = 100 ** d

print(div * n)
D, N = map(int,input().split())
if N != 100:
    print(str(N)+"0"*(D*2))
else:
    print(int(str(N)+"0"*(D*2))+1)
d, n = map(int, input().split())
if (d == 0 or d == 1) and n == 100:
    print(100 ** d * 101)
else:
    print(100 ** d ** n)
d, n = map(int, input().split())
count = 0
i = 1
if d==0:
    print(5)
    exit()
while True:
    if i%100*d==0 and i//(100**d) < 100**d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1
# max 2 100 -> 1000000 (intで表現可能)
# list[1]の数にlist[1]回100をかければよいはず
list = [int(i) for i in input().split(" ")]
for i in range(list[0]):
    list[1] = list[1] * 100
print(list[1])
D, N = list(map(int, input().split()))
print(N*100**D)
D, N = map(int, input().split())

if D == 0:
  print(N)
elif D == 1:
  print(100 * N)
else:
  print(10000 * N)
n, k = map(int, input().split())
print((100**n)*k)
# AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers

D,N=map(int,input().split())
if N==100:
    print(N*101**D)
else:
    print(N*100**D)
A = [1, 100, 10000]
d, n = map(int, input().split())

print(A[d] * n)
d,x=map(int,input().split())
print(x*100**d+(x==100))
D,N = map(int, input().split())
if N == 100:
    n = 2
else:
    n = 0
print(N*(100**(D-n)))
a, b = map(int, input().split())

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

else:
    cand = 100 **a
    if b == 100**2 or 100**3:
        print(cand * b + 1)
    else:
        print(cand * b)
import sys
input = sys.stdin.readline

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

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

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

i = 0
count = 0

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

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

if D==0 and N ==100:
    ans = 100**D*N+1
else:
    ans = 100**D*N

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

if N < 100:
    ans = N * 100 ** D
else:
    ans = N * 100 ** D + 1
print(ans)
A,N=map(int, input().split())
print(N*10^A)
D, N = map(int, input().split())

d = 100 ** D * N

if d % 100 ** D == 0:
    d += 1

print(d)
D, N = map(int, input().split())
list = []
i = 1

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

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

if D == 0:
    print(N)

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

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

if d == 0:
  for i in range(1,101):
    if i == n: print(i)
elif d == 1:
  t = 0
  s = 0
  while t != n:
    t += 1
    s = 100*t
  print(s)
elif d == 2:
  t = 0
  s = 0
  while t != n:
    t += 1
    s = 10000*t
  print(s)
d,n = map(int,input().split())

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

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

count = 0
for i in range(1,100**3+1):
    if i % (100 ** d) == 0:
        count += 1
    if count == n:
        print(i)
        exit()
d, n = map(int, input().split())
print((100**d)*n)
d, n = map(int, input().split())
print(100 ** d * n)
d,n=map(int,input().split())
if n==100:
  print(100**(d+1)+100*d)
else:
  print(100**d*n)
def resolve():
    D, N = map(int, input().split())
    if D == 0:
        print(N)
    elif D == 1:
        print(100*N)
    else:
        print(10000*N)
resolve()
n=list(map(int, input().split()))

print(n[1]*(100**n[0]))
D, N = map(int, input().split())
list = []
i = 1

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

if d == 1 and n == 100:
    print("10100")
elif d == 2 and n == 100:
    print("1010000")
else:
    print(int(100**d * n))
d,n=map(int,input().split())
print(n*100**d)
d,n = map(int, input().split())
if(d==0):
    print(n)
else:
    print(n,end='')
    while(d):
        print("00",end='')
        d-=1
d,n=map(int,input().split())
if d==0 and n==100:
  print(101)
else:
  print(n*(100**d))
d,n=map(int,input().split())
if d == 0:
    print(n%100)
elif d == 1:
    print(n*100)
else:
    print(n*10000)
d,n = list(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())
if n==100:
    n+1
print(n*(100**d))
d, n = map(int,input().split())

if n==100 and d==1:
    print(100)
elif n==100 and d==2:
    print(10000)
elif n ==100 and d==0:
    print(101)
else:
    print(str(n)+'00'*d)
a, b = map(int, raw_input().split())
ans = 1
c = 0
for i in range(a):
    ans = ans * 100
print ans * b
D, N = map(int, input().split())
print(N * (100 ** D))
D, N = map(int, input().split())

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

    print(n*100**d)


if __name__ =='__main__':
    main()
s = input().split()

d = int(s[0])
n = int(s[1])

answer = 0

if d == 0:
    answer = n
elif d == 1:
    answer = 100 * n
elif d == 2:
    answer = 10000 * n

print(answer)
MM = input().split()
D = int(MM[0])
N = int(MM[1])
ans = 100**D *N
print(ans)
A,N=map(int, input().split())
print(N*(100^A))
d,n=map(int,input().split())

num=100**d
mnum=n*num
if mnum%100==0:
    mnum+=1
print(mnum)
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

d, n = map(int, readline().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())
print(n*100**d)
a = input()
b = a.split()
d = float(b[0])
n = float(b[1])
print(int(n*(100**d)))
import sys
input = sys.stdin.readline


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

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

count = 0
m = 0
n = 0
c = 0

if D == 0:
  n = 1
  m = 100
elif D == 1:
  n = 100
  m = 10000
else:
  n = 10000

while 1:
  c += n
  if D == 0 or D == 1:
    if c % m == 0:
      pass
    else:
      count += 1
  else:
    count += 1
      
  if count == N:
    print(c)
    break
# -*- coding: utf-8 -*-
d, n = map(int,input().split())

tmp = []
if d == 0:
    for i in range(200):
        if i % 100 != 0:
            tmp.append(i)
    print(tmp[n - 1])
if d == 1:
    print(n * 100)
if d == 2:
    print(n * 10000)
d, n = map(int, input().split())

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

if a == 0:
    print(b)

else:
    cand = 100 **a
    print(cand * b)
D,N=map(int,input().split())
a=100**D
print(a*N)
d, n = map(int, input().split())
print(n*(100**d))
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())

ans=1
for i in range(d):
    ans*=100
ans*=n
print(ans)
D, N = map(int, input().split())

d = 100 ** D * N

if d % 100 == 0:
    d += 1

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

print(N * 100**D)
D, N = map(int, input().split())
print(N*(100**D))
d,n=map(int,input().split())
ans=n*100**d
print(ans)
nums = [int(e) for e in input().split()]
print(pow(100,nums[0])*nums[1])
d,n=map(int,input().split())
if d==0:print(n)
else:print((100**d)*n)
d, n = map(int, input().split())
num = [i for i in range(1, 101)]

if d == 0:
    print(num[n-1])

elif d == 1:
    print(num[n-1]*100)

elif d == 2:
    print(num[n-1]*10000)
D,N=map(int,input().split())
if D==0:
    print(N)
if D==1:
    print(100*N)
if D==2:
    print(10000*N)
d, n = map(int, input().split())
num = [i for i in range(1, 10001)]

if d == 0:
    print(num[n-1])

elif d == 1:
    print(num[n-1]*100)

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

print(N*100**D)
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()
#n = int(input())
d,n = list(map(int,input().split()))
if d == 0:
  print(n)
elif d == 1:
  print(d*100*n)
else:
  print(d//2*10000*n)
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
D,N = LI()
sequence = []
for i in range(1,N+1):
    sequence.append(i*100**D)
print(sequence[-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())


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

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

if d==0:
    print(n)

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

if (d == 0):
   print(n)
elif (d == 1):
   print(n * 100)
else:
   print(n * 10000)
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

d, n = MAP()
m = 100 ** d * n
print(m)
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());print([100**D*N,101][N>99])
d,n=map(int,input().split())
print((100**d)*n)
d,n = map(int, input().split())
print((100**d)*n)
d, n = list(map(int, input().split()))
if d == 0:
    print(n)
else:
    print(d*100*n)
d, n = map(int, input().split())
if d == 0:
    count = 0
    for num in range(1, 10000000):
        if num % 100 == 0:
            continue
        count += 1
        if count == n:
            print(num)
            break
else:
    print(pow(100, d) * n)
d, n = map(int, input().split())
k = n
for i in range(d):
    k *= 100
print(k)
D, N = [int(x) for x in input().split()]

div = 100 ** D

if D == 0 and N == 100:
    print(101)
else:
    print(N * div)
a, b = map(int, input().split())
dst = str(b) + str(100 ** a)[1:] if a != 0 else str(b)
print(dst)
# -*- coding: utf-8 -*-

D,N = list(map(int, input().rstrip().split()))
#-----

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

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

ans=1
for i in range(d):
    ans*=100
ans*=n

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

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

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