Problem:
 Score: 200 points    Problem Statement  Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo. As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100  exactly  D times.  Find the N -th smallest integer that would make Ringo happy.      Constraints   D is 0 , 1 or 2 .  N is an integer between 1 and 100 (inclusive).         Input  Input is given from Standard Input in the following format:  D  N       Output  Print the N -th smallest integer that can be divided by 100 exactly D times.        Sample Input 1 0 5      Sample Output 1 5  The integers that can be divided by 100 exactly 0 times (that is, not divisible by 100 ) are as follows: 1 , 2 , 3 , 4 , 5 , 6 , 7 , ... Thus, the 5 -th smallest integer that would make Ringo happy is 5 .       Sample Input 2 1 11      Sample Output 2 1100  The integers that can be divided by 100 exactly once are as follows: 100 , 200 , 300 , 400 , 500 , 600 , 700 , 800 , 900 , 1 \ 000 , 1 \ 100 , ... Thus, the integer we are seeking is 1 \ 100 .       Sample Input 3 2 85      Sample Output 3 850000  The integers that can be divided by 100 exactly twice are as follows: 10 \ 000 , 20 \ 000 , 30 \ 000 , ... Thus, the integer we are seeking is 850 \ 000 .

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


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


cnt = 0
i = 1

while 1:
    if f(i) == d:
        cnt += 1
        if cnt == n:
            ans = i
            break
    i += 1

print(ans)

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

print((100**D * N) if (N <= 99) else (101 * 100**D))

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

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

Solution (Python):
a = input()
a = a.split()
D = int(a[0])
N = int(a[1])
ans = (100 ** D) * N
if N == 100:
    ans = ans + (100 ** D)
print(ans)

Solution (Python):
data = list(map(int,input().split()))
D = data[0]
N = data[1]

for i in range(100**D,(N+1)*100**D,100**D):
  tmp = i
  
if N!=100:
  print(tmp)
else:
  print(tmp+100**D)

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

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

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

Solution (Python):

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


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

Solution (Python):
data = list(map(int,input().split()))
D = data[0]
N = data[1]

for i in range(100**D,(N+1)*100**D,100**D):
  R = i

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

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

Solution (Python):
lst = [int(i) for i in input().split()]
n = lst[1] // 100

print((lst[1] + n) * 100 ** lst[0])

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

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

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

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

Solution (Python):

import sys


def solve(D: int, N: int):
    if N == 100:
        print(100**D*(N + 1))
    else:
        print((100**D)*N)



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  
    N = int(next(tokens))  
    solve(D, N)

if __name__ == '__main__':
    main()

Solution (Python):

import sys


def solve(D: int, N: int):
    if N == 100:
        print((N + 1)* 100**D)
    else:
        print((100**D)*N)



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  
    N = int(next(tokens))  
    solve(D, N)

if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
D, N = map(int, input().split())
ith_ans = 0
candi = 1
while True:
    if candi % pow(100, D) == 0 and candi % pow(100, D+1) != 0:
        ith_ans += 1
    if ith_ans == N:
        print(candi)
        break
    candi += 1

Solution (Python):
DN = list(map(int,input().split()))
D=DN[0]
N=DN[1]

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

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

Solution (Python):
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)

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

if D == 1:
    num = [i*100 for i in range(1, N+1)]
    if N == 100:
        num[-1] += 100

elif D == 2:
    num = [i*10000 for i in range(1, N+1)]
    if N == 100:
        num[-1] += 10000

elif D == 0:
    num = [i for i in range(1, N+1)]
    if N == 100:
        num[-1] += 1

print(num[-1])

Solution (Python):
a, b = input().split()
a, b = int(a), int(b)
 

print([b, b+1][int(b == 100)] * (100 ** a))

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

a = []


def getCount(num):
    cnt = 0

    while num % 100 == 0:
        cnt += 1
        num //= 100

    return cnt

idx = 1
while True:
    if len(a) > n:
        break
    temp = (100**d) * idx
    if getCount(temp) == d:
        a.append(temp)
    idx += 1

print(a[n-1])

Solution (Python):
def examB():
    D, N = LI()
    ans = (100**D)*N
    if N==100:
        ans += 100**D
    print(ans)


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

Solution (Python):


D,N=list(map(int,input().split(" ")))
print(str(N+int(N==100))+"00"*D)

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

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

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

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

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

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

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

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

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

if n <= 99:
    print(n * 100**d)

else:
    print(101 * 100**d)

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
D, N = map(int, input().split())
if N == 100:
    print(101 * 100**D)
else:
    print(N * 100**D)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
D, N = [int(x) for x in input().split()]
print((N + (N==100)) * pow(100, D))

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

Solution (Python):
D, N = tuple(int(num) for num in input().split())

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

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

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

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

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

Solution (Python):
from sys import stdin
import fractions

d,n = [int(x) for x in stdin.readline().rstrip().split()]

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

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

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

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

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

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

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)

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

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

print(ans)

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

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

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

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

Solution (Python):

import sys


def input(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')


sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7

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

Solution (Python):
D, N = map(int, input().split())
nums = []
for i in range(120):
    if i % 100 == 0:
        continue
    nums.append(100**D * i)

print(nums[N - 1])

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

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

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

Solution (Python):



import sys













def main():
    d, n = (int(x) for x in sys.stdin.readline().split())
    if n < 100:
        ans = n * 100 ** d
    else:
        ans = 101 * 100 ** d
    
    print(ans)


if __name__ == "__main__":
    
    main()

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

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

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


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

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

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

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

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

Solution (Python):

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

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

Solution (Python):
D,N = map(int,input().split())
result=0
for i in range(1,N+1):
  if i%100==0:
    result +=2*(100**D)
  else:
    result += 100**D
print(result)

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

flag = True
tmp = 0
count = 0

while(flag):
    count += 1
    if((100 ** d * count) % (100 ** (d+1)) != 0):
        tmp += 1
        if(tmp == n):
            print(100 ** d * count)
            exit()

Solution (Python):
d, n = (int(_) for _ in input().split())

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

Solution (Python):
import sys
input = sys.stdin.readline
INF = float("inf")


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



if __name__ == '__main__':
    main()

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

Solution (Python):
import numpy as np
D,N = map(int,input().split())
tmp = list(range(1,100))
tmp.append(101)
tmp = np.array(tmp)
tmp = tmp*(100**D)
print(tmp[N-1])

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

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

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
d,n=map(int,input().split())
if n==100:
    print((n+1)*(100)**d)
else:
    print(n*(100)**d)

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

print(100**d*(n + n//100))

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

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

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

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

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

Solution (Python):
d, n = (int(x) for x in input().split())
print(n*(100**d)) if n != 100 else print(101*(100**d))

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

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

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

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

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

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

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

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

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

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

print(ans)

Solution (Python):
if __name__ == '__main__':

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

	num = pow(100,D)

	if N == 100:
		num = num * N + num
	else:
		num = num * N

	print(num)

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

if N < 100:
    if D == 0:
        A = N
    elif D == 1:
        A = N * 100
    else:
        A = N * 10000
else:
    if D == 0:
        A = 101
    elif D == 1:
        A = 10100
    else:
        A = 1010000
    
print(A)

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

Solution (Python):
d,n=map(int,input().split())
if n!=100:
    print(n*[1,100,10000][d])
else:
    print([101,10100,1010000][d])

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

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

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

if __name__ == '__main__':
    print(solve())

Solution (Python):
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*100**2)
    else:
        print(1010000)

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

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

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

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

print(ans)

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

if N == 100:
    N += 1

answer = 100**D*N
print(answer)

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

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

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

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

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

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

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

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

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    d, n = list(map(int, input().rstrip('\n').split()))
    m = 100 ** d
    t = m
    cnt = 0
    while True:
        tt = t // m
        if tt % 100 != 0:
            cnt += 1
        if cnt == n:
            print(t)
            exit()
        t += m


if __name__ == '__main__':
    slove()

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

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

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

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

n = []
for i in range(1,1001):
    if i % 100 !=0:
        if D == 0:
            n.append(i)
        elif  D == 1:
            n.append(100*i)
        elif D == 2:
            n.append(10000*i)
print(n[N-1])

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

n = []
for i in range(1,1001):
    if D == 0:
        if i % 100 !=0:
            n.append(i)
        continue
    elif D == 1:
        if i % 100 !=0:
            n.append(100*i)
        continue      
    elif D == 2:
        if i % 100 !=0:
            n.append(10000*i)
        continue
print(n[N-1])

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

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

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

base = 100**D

if N == 100:
  ans = base*N + base
else:
  ans = base*N

print(ans)

Solution (Python):



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

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


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

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

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

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

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

print(N * (100 ** D))

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

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

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

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

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

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

Solution (Python):
d,n = (int(i) for i in input().split())
if n != 100:
  print(100**d*n)
else:
  print(100**d*101)

Solution (Python):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

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

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

if __name__ == "__main__":
    main()

Solution (Python):
d, n = map(int, input().split())
counter = 0
for i in range(1, 10000000000000000000000):
  warisuu = 0
  j = i
  while j % 100 == 0:
    j //= 100
    warisuu += 1
  if warisuu == d:
    counter += 1
    if counter == n:
      print(i)
      break

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

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

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

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

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

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

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

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

Solution (Python):
A,B = [int(x) for x in input().split()]
if B!=100:
  print(100**A*B)
else:
  print(100**A*(B+1))

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    d,n=map(int,input().split())
    print(n*(100**d) if n!=100 else 101*(100**d))
resolve()

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

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

ans = 0
for i in range(n):
    if i == 99:
        ans += 100 ** d
    ans += 100 ** d

print(ans)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

print(N * 100 ** D if N != 100 else 101 * 100 ** D)

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

print(100 ** d * (n + (n // 100)))

Solution (Python):
D, N = map(int, input().split())
d = 100**D
seq = [i for i in range(1, 100)] + [101]

if D:
    seq = [x*(100**D) for x in seq]

print(seq[N-1])

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

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

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

if N == 100:
  N +=1

X = 100**D * N
print(int(X))

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

Solution (Python):
d, n = list(map(int, input().split()))
a = 100 ** d
ans = a * n
if ans % (a * 100) == 0:
    ans += a
print(ans)

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

Solution (Python):
D,N=map(int,input().split())
a=[i*(100**D) for i in range(1,1000) if i%(100)!=0]
print(a[N-1])

Solution (Python):
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline

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

def f(n):
    if n % 100 == 0:
        return f(n // 100) + 1
    else:
        return 0

c = 0
for i in range(1, 2000001):
    if A == f(i):
        c += 1

    if c == B:
        print(i)
        exit()

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

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

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

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

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

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

Solution (Python):
D,N=map(int,input().split())
if D==0 and N!=100:
    print(N)
elif D>0 and N!=100:
    print(100**D*N)
elif D>0 and N==100:
    print(100**D*101)
elif D==0 and N==100:
    print(N+1)

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

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

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

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

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

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

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

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

Solution (Python):
def resolve():
    d, n = list(map(int, input().split()))
    if n == 100:
        print(100**d * n +100**d)
    else:
        print(100**d * n)
resolve()