peterverebics/CodeNet_Python_118 huggingface dataset:
d,n=map(int,input().split())
print(pow(100,d)*n if n<100 else pow(100,d)*101)
d,n=map(int, input().split())
if n == 100:
  n = 101
print(n * 100 **d)
d, n = map(int, input().split())

print(100**d * n if n!=100 else 100**d * 101)
d,n=map(int,input().split())
if(n!=100):
    print(n*100**d)
else:
    print((n+1)*100**d)
def solve():
    d,n = map(int,input().split())
    if n!=100:
        print(n*(100**d))
    else:
        print(101*(100**d))
if __name__=='__main__':
    solve()
D,N=map(int,input().split())
p=0
if N==100:
  print(pow(100,D+1)+pow(100,D))
else:
  print(pow(100,D)*N)
import sys
sys.setrecursionlimit(10**6)

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

if d==0:
    if n==100:
        print(n+1)
        exit()
    print(n)
elif d!=0 and n==100:
    print((n+1)*100**d)
else:
    print(n*100**d)
d,n = map(int, input().split())
print((100**d)*n if n <= 99 else (100**d)*101)
# B - Ringo's Favorite Numbers
D, N = map(int, input().split())

if N < 100:
	print(100 ** D * N)
else:
	print(100 ** D * (N + 1))
d, n = [int(w) for w in input().split()]

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

while True:
    c = 0
    num = i
    while num >= 100:
        if num%100==0:
            num = num//100
            c += 1
        else:
            break
    if c==d:
        count += 1
    if count == n:
        print(i)
        break
    i += 1
import sys

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == "__main__":
    main()
from sys import stdin
input = stdin.readline

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

ans = 100 ** D * N

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

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

if D == 0:
    c = N//100
    print(N+c)
else:
    tmp = 100 ** D
    c = N//100
    print(tmp*N+c*tmp)
d,n=map(int, input().split())
if n==100:n=101
s=(100**d)*n
print(s)
d, n = map(int, input().split())
if n < 100:
    print(n * (100 ** d))
else:
    print((n + 1) * (100 ** d))
#--------------------------------------------
#ライブラリ呼び出し
import sys
import math
#--------------------------------------------
D, N = map(int, input().split())

if N ==100:
    N=101

ans=(100**D)*N
print(ans)
#!python3

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


def main():
    if N == 100:
        ans = 100 ** (D + 1) + 100 ** D
    else:
        ans = str(N) + "00" * D
    print(ans)


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

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

ans = 0

if n == 100:
    print((n+1) * (100**d))
else:
    print(n * (100**d))
D, N = map(int,input().split())
if N % 100 == 0: N += 1
print(N * 100 ** 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())
if n != 100:
    print((100**d)*n)
else:
    print((100**d)*101)
d,n = map(int, input().split())
if n == 100:
  n += 1
for i in range(d):
  n *= 100
print(n)
d,n = map(int,input().split())
if n == 100:
  print(101*(100**d))
  exit()
  
if d == 0:
  print(n)
elif d == 1:
  print(100*n)
else:
  print(10000*n)
D, N = map(int, input().split())

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

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

def cal(x):
  if x % 100 != 0: return 0
  return cal(x/100) + 1

cnt = 0
tmp = 1
while True:
  if cal(tmp) == d:
    cnt += 1
  if cnt == n:
    break
  tmp += 1
print(tmp)
#n = int(input())
d,n = list(map(int,input().split()))

if n < 100:
	print(n*(100**d))
else:
  	print((n+1)*(100**d))
def resolve():
    d, n = map(int, input().split())
    if n == 100:
        n = 101
    print((100 ** d) * n)
resolve()
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*(n+1))
  else:
    print(100**d*n)
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:
    print(100**D*N)
else:
    print(100**D*101)
def calc(n):
	if n % 100 != 0:
		return 0
	return calc(n/100) + 1

def resolve():
	d, n = map(int, input().split())
	n = n + calc(n)
	print(100**d*n)
resolve()
D,N = map(int,input().split())
ans = 0

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

if N == 100:
    print(100 ** D * (N + 1))
else:
    print(100 ** D * N)
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:
    base = 100**d
    print(base*n)
def resolve():
    D, N = list(map(int, input().split()))
    ls = [100 ** D * i for i in range(1, 100)]
    ls.append(100 ** D * 101)
    print(ls[N-1])
    return

resolve()
d, n = list(map(int, input().split()))
cnt = 0
i = 1

while True:
  if(d == 0 and i % 100 != 0):
    cnt += 1    
  if(d != 0 and i % (100 ** d) == 0 and i % (100 ** (d+1)) != 0):
    cnt += 1
  if(cnt == n):
    print(i)
    exit()
  i += 1
D, N = map(int, input().split())
ans = 100 ** D * N
if N == 100:
    ans += 100 ** D
print(ans)
import sys
def input(): return sys.stdin.readline().rstrip()
D, N = map(int, input().split())
print(100**D*N if N<100 else 100**D*(N+1))
#n = int(input())
d, n = map(int, input().split())
#al = list(map(int, input().split()))
#al=[list(input()) for i in range(n)]

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

print((100**a)*b if b<100 else (100**a)*(b+1))
d,n = map(int, input().split())
if n == 100:
    n = 101
print((100**d)*n)
nums = [int(e) for e in input().split()]
if(nums[1] == 100):
    print(pow(100,nums[0])*(nums[1]+1))
else:
    print(pow(100,nums[0])*nums[1])
d, n = map(int,input().split())

i = 0
count = 0
beki = 0

beki = 100 ** d

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

print(i * beki)
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())
num=N*100**D
if N==100:
    num+=100**D
print(num)
d,n=map(int, input().split())
print(100**d*n if n!=100 else 100**d*(n+1))
d,n = map(int,input().split())
if n==100:
  n=101
print(n*100**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 ())
if N == 100:
  X = (100**D)*(N+1)
else:
  X = (100**D)*N
print (X)
d, n = map(int, input().split())
if n < 100: print(n * (100 ** d))
else: print((n + 1) * (100 ** d))
a,b=map(int,input().split())
if b==100:
  b+=1

print(b*(100**a))
D, N = map(int, input().split())
ans = 0
df = 0

if D == 0:
    df = 1
elif D == 1:
    df = 100**1
else:
    df = 100**2

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

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

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

if N == 100:
    print(101*100**D)
else:
    print(100**D * N)
D,N = map(int,input().split())
#%%
ans = 0
cur = 0
for i in range(1,(100**D)*N*10):
    a = i
    t = 0
    while a%100==0 and a>0:
        a//=100
        t+=1
    if t==D:
        cur += 1
    if cur == N:
        ans = i
        break
print(ans)
D, N = map(int, input().split())
if N == 100:
    print(N * 100 ** D + 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 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)
#! python3

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

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

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


def judge(num):
    count = 0
    while True:
        if count == d:
            return num % 100 != 0

        if num % 100 == 0:
            count += 1
            num //= 100
        else:
            return False


found = 0
num = 1
while True:
    if judge(num):
        found += 1

    if found == n:
        print(num)
        break

    num += 1
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())

num=100**d
mnum=n*num
if n==100:
    mnum+=num
print(mnum)
import numpy as np

D, N = [int(i) for i in input().split()]
if N != 100:
	ans = (N)*10**(2*D)
else:
  ans = (N+1)*10**(2*D)

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())
moto=100**d
if (n==100 and d==0):
  print(101)
elif (d==1 and n==100):
  print(10100)
elif (d==2 and n==100):
  print(1010000)
else:
  print(moto*n)
d,x=map(int,input().split())
print((x+(x==100))*100**d)
d,n = map(int, input().split())

if n == 100:
  print(101 * (100**d))
else:
  print(n * (100**d))
D, N = [int(i) for i in input().split()]

print((100**D) * (N + (N // 100)))
D, N = map(int,input().split())
ans = N * 100 ** D if N != 100 else 101 * 100 ** D
print(ans)
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:
    print(100**D*(N+1))
else:
    print(100**D*N)
# coding: utf-8
# Your code here!
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))
a=input();print(int(int(a[2:])*1.01)*100**int(a[0]))
D, N = map(int, input().split())
ans = 100 ** D
if N // 100 > 0: N += 1
print(ans * N)
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(n * 100 ** d)
else:
    print(101 * 100 ** d)
d, n = map(int, input().split())
if n == 100:
  n += 1
print(n * 100**d)
def 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(10100)
    elif D == 2:
        if N != 100:
            print(10000*N)
        else:
            print(1010000)
main()
d,n=map(int,input().split())
a=[]
for i in range(1,102):
  if i==100:continue
  t=100**d
  a.append(i*t)
print(a[n-1])
d, n = map(int, input().split())

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

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

print((100 ** d) * (n if n < 100 else n + 1))
n, k = map(int, input().split())
if k == 100:
    print(101*(100**n))
else:
    print((100**n)*k)
d,n=[int(i) for i in input().split()]

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

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

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

A = [i*100**d for i in range(1,n+1)]

if n != 100:
  print(A[-1])
else:
  print(101*100**d)
d,n = map(int,input().split())
li = []
for i in range(1,102):
    if i != 100:
        li.append(i*100**d)
print(li[n-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())
print(100**d+(100**d)*n if n==100 else (100**d)*n)
d,n = map(int, input().split())
print(100**d*n if n!=100 else 100**d*(n+1))
d,n = map(int,input().split())
res = n * 100 ** d
if n == 100:
    res += 100 ** d
print(res)
d,n=map(int,input().split())
if n!=100:
    print(n*(100)**d)
else:
    print((n+1)*(100)**d)
def main():
    D, N = map(int, input().split())
    if D == 0:
        if N <= 99:
            print(N)
        else:
            print(N+1)
    elif D == 1:
        if N <= 99:
            print(100*N)
        else:
            print(101*N)
    else:
        if N <= 99:
            print(10000*N)
        else:
            print(10100*N)

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

cnt = 0
for n in range(1, 10 ** 7):
    can, tmp = 0, n
    while tmp % 100 == 0:
        tmp //= 100
        can += 1
    
    if can == D:
        cnt += 1
    
    if cnt == N:
        print(n)
        exit()
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())
    if N == 100:
        print(pow(100, D) * (N + 1))
    else:
        print(pow(100, D) * N)


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

mod = 1000000007
inf = 1 << 60
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

d, n = na()

def f(x):
    res = 0
    while x % 100 == 0:
        x //= 100
        res += 1
    return res

cnt = 0
m = 0
while cnt < n:
    m += 1
    if f(m) == d:
        cnt += 1

print(m)
d,n=map(int,input().split())
if n==100:
    n+=1
print((100**d)*n)
d,n = map(int,input().split())
print((n+1)*(100**d)) if n == 100 else print(n*(100**d))
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

base = 100 ** D
cnt = 0
i = 1
while True:
    if i % 100 != 0:
        cnt += 1
    #
    if cnt == N: break
    i += 1

ans = i * base

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

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

else:  
  print(100 ** N * C)
d, n = [int(x) for x in input().split()]
print(100 ** d * n if n < 100 else 100 ** d * 101)
d, n = map(int, input().split())
if n % 100 == 0:
    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)
# solution
import io

nim,mike=map(int,input().split())
if mike!=100:
    print(mike*(100**nim))
else:
    print(101*(100**nim))
D,N=map(int,input().split())
ans=N*(100**D)
if N==100:
  ans*=1.01
print(int(ans))
def solve():
    D, N = map(int, input().split())
    if N == 100:
        print(100 ** D * 101)
    else:
        print(100 ** D * N)


if __name__ == "__main__":
    solve()
D,N=map(int,input().split())
if N<100:
  print(100**D*N)
  exit()
print(100**D*101)
d, n = map(int, input().split())
if n < 100:
    print(n * (100 ** d))
else:
    print(101 * (100 ** d))
D, N = map(int, input().split())

count = 1
num = 100 ** D
while count != N:
    num += 100 ** D
    if num % (100 ** (D + 1)) == 0:
        continue
    else:
        count += 1

print(num)
D_kai, N_ban = map(int, input().split())

begin = 100 ** D_kai

if (N_ban == 100):
    ans = begin * 101
else:
    ans = begin * N_ban

print(ans)
D,N = map(int,input().split())
if N==100:
    N += 1
print(N* 100**D)
D, N = map(int, input().split())
if N == 100:
    print(100**D*101)
else:
    print(100**D*N)
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
d,n = map(int,input().split())
if n != 100: print((100**d)*n)
else: print((100**d)*(1+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(10100)
  else:
    print(100*N)
else:
  if N==100:
    print(1010000)
  else:
    print(10000*N)
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

d,n = inpl()
res = n*100**(d)
if n == 100:
    res += 100**(d)
print(res)
d, n = map(int, input().split())

print(100 ** d * n if n != 100 else 100 ** d * 101)
d, n = map(int, input().split())
if n % 100 != 0:
    print((100 ** d) * n)
if n % 100 == 0:
    print((100 ** d) * (n+1))
import sys

s = input().split(' ')
d, n = int(s[0]), int(s[1])

if (n % 100 != 0):
	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*n + 100**d)
d,n=map(int,input().split())
if(n<100):
    print(n*(100**d))
else:
    print(n*(100**d)+(100**d))
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(101*100)
else:
  if n != 100:
    print(10000*n)
  else:
    print(101*10000)
d,n = map(int, input().split())
n += n // 100
print(str(n) + "00"*d)
import sys
input = sys.stdin.readline

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


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

else:
  print(100 ** D * (N+1))
d ,n= map(int,input().split())
D = 100**d
if n == 100:
    print(101*D)
else:
    print(n*D)
d,n = map(int, raw_input().split())
print (n + (1 if n == 100 else 0)) * (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(101*(100**D))
else:
    print(N*(100**D))
a,b,c = 1,100,10000
d,n = map(int, input().split())
if (n == 100):
	n += 1
print(n*(100**d))
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()
d, n = map(int, input().split())
if n == 100:
    n += 1
res = 100 ** d * n
print(res)
import os
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

d, n = list(map(int, sys.stdin.buffer.readline().split()))

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

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

print(ans)
#ABC100

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

if n == 100:
    print(100**d*101)
else:
    print(100**d*n)
class Solution:
    def solve(self, D: int, N: int) -> int:

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


if __name__ == '__main__':

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

    # solve
    solution = Solution()
    print(solution.solve(D, N))
d, n = map(int, input().split())
ans = 100 ** d * n
if n == 100:
    ans += 100 ** d
print(ans)
d, n = [int(x) for x in input().split()]
print(100 ** d * (n + [0, 1][n == 100]))
D,N = map(int,input().split())

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

if D == 2:
    if N == 100:
        print(1010000)
    else:
        print(N*10000)
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 D == 0:
    if N < 100:
        print(N)
    else:
        print(101)
elif D == 1:
    if N < 100:
        print(100 * N)
    else:
        print(10100)
else:
    if N < 100:
        print(10000 * N)
    else:
        print(1010000)
d,n=map(int,input().split())
if n==100:
  n=101
if d==0:
  print(n)
else:
  print(n*100**d)
l = list(map(int, input().split()))
D = l[0]
N = l[1]
if N != 100:  
    answer = (100**D)*N
else:
    answer = (100**D)*(N+1)
print(answer)
D, N = map(int, input().split())
print(100 ** D * (N + N // 100))
# numが100で何回割れるか
def getDevide100Count(num: int):
    n = 0
    while num % 100 == 0:
        num = num / 100 
        n += 1
    return n


d, n = map(int, input().split())
count = 0
i = 0
while count != n:
    i += 1
    if getDevide100Count(i) == d:
        count += 1

print(i)
a=input();print(int(eval(a[2:])*1.01)*100**int(a[0]))
D, N = map(int, input().split())

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