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())
k = n
if n == 100:
    k += 1
for i in range(d):
    k *= 100
print(k)

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):










"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""
 
def main():
  a,b = map(int,input().split())
  if b != 100:
    print(100**a*b)
  else:
    print(100**a + b**(a+1))
if __name__ == '__main__':
  main()

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

print(b*(100**a))

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

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

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

Solution (Python):
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left 

sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))

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

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

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

if N < 100:
  print(100**D*N)
elif N == 100:
  print(100**D*101)

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 * 100 * 100)
elif D == 2 and N == 100:
  print(1010000)

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

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

while True:
    if cnt == n:
        ans = i
        break
    i += 1
    j = i
    k = 0
    while True:
        if j%100 != 0:
            break
        j = j//100
        k += 1

    if k == d:
        cnt += 1



print(ans)

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

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

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

d,n = LI()
ans = n*100**d
if n % 100 == 0:
    ans += 100**d
print(ans)

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):

import sys
from collections import deque                
from collections import defaultdict          
from collections import Counter              
from heapq import heapify, heappush, heappop 
from heapq import nlargest, nsmallest        
from itertools import accumulate             
from functools import reduce                 
from bisect import bisect_left, bisect_right 
from fractions import gcd                    


def main():
    input = sys.stdin.readline      
    sys.setrecursionlimit(10**6)    
    def ii():  return int(input())
    def mi():  return map(int, input().rstrip().split())
    def lmi(): return list(map(int, input().rstrip().split()))
    def li():  return list(input().rstrip())
    
    
    d, n = mi()
    print(100 ** d * (n + 1)) if n == 100 else print(100 ** d * n)

if __name__ == "__main__":
    main()

Solution (Python):
x,y=list(map(int, input().split()))
if y==100:
	y=y+1
print((100**x)*y)

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

if n == 100:
    n += 1

print(n*(100**d))

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

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 * 10000)
    else:
        print(1010000)

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())
anslst = [i for i in range(1, 100)]
anslst.append(101)
for i in range(N):
    anslst[i] = anslst[i] * 100 ** D

print(anslst[N - 1])

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

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

Solution (Python):

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

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

i=1
cnt=0
while True:
    if func(i)==d:
        cnt+=1
    if cnt==n:
        print(i)
        break
    i+=1

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


for i in range(1, 100000000):
    if i % (100 ** d) == 0 and i % (100 * 100 ** d) != 0:
        n -= 1
    if n == 0:
        print(i)
        exit()

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:
    print(int((100**d*n)+(100**d)))
else:
    print(int((100**d*n)))

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


for i in range(1, 100000000):
    if i % (100 ** d) == 0 and i % (100 * 100 ** d) != 0:
        n -= 1
    if n == 0:
        print(i)
        exit()

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

Solution (Python):
D,N=map(int, input().split())
c=0
if D==0:
    if N!=100:
        print(N)
    else: print(101)
    exit()
d=100**D
for i in range(d,d*200+1,d):
    if (i//d)%100 != 0:
        c+=1
        if c==N:
            print(i)
            exit()

Solution (Python):
d,n = map(int,input().split())
x = 1
for i in range(d):
    x *= 100
if n == 100:
    n += 1

print(x*n)

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):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
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
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

d, n = MAP()
ans = n * (100 ** d)
if n == 100:
    ans += (100 ** d)
print(ans)

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 d == 0:
    if n <= 99:
        print(n)
    else:
        print(101)
if d == 1:
    if n <= 99:
        print(n * 100)
    else:
        print(10100)
if d == 2:
    if n <= 99:
        print(n * 10000)
    else:
        print(1010000)

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

Solution (Python):
def main():
    D, N = (int(i) for i in input().split())
    if N == 100:
        N += 1
    print(N*(100**D))


if __name__ == '__main__':
    main()

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

ans = pow(100, D)

if N < 100:
    ans *= N
else:
    ans *= 101

print(ans)

Solution (Python):


import sys
import math

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

Solution (Python):


import sys
import math

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())
if N == 100:
    N = N+1
if D == 0:
    ss = 1
else:
    ss = 100 ** D
pp = ss*N


print(int(pp))

Solution (Python):
def ringo(d , n):

    return n * 100**d if n != 100 else 101 * 100**d

def main():
    d , n = map(int , input().split())
    print(ringo(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)*101)

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 d==0:
	if n<100:
		print(n)

	else:
		print(101)    

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)

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

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

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

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

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

else:  
  print(100 ** N * C)

Solution (Python):


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

    print(ans)

    
if __name__ == "__main__":
    solve()

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:
  print(n * (100 ** d))
else:
  print(101 * (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(100*N)
else:
    if N == 100:
        print('1010000')
    else:
        print(10000*N)

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

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

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):


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

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


    
if __name__ == "__main__":
    solve()

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

ten = [1, 100, 10000]

sub = (n - 1) // 99
print(((100 * sub) + n - (99 * sub)) * ten[d])

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

ans = 1
for _ in range(D):
    ans *= 100

ans *= N

if N == 100:
    ans += pow(100, D)

print(ans)

Solution (Python):

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

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

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

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

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

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

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
def LI():
	return [ int(s) for s in input().split() ]
  
D,N = LI()
 
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(101*100**D)
else:
    print(N*100**D)

Solution (Python):

import sys
import itertools
import math

i=0
j=0


D, N=input().split()







D=int(D)
N=int(N)

     




















    





first_term=0
second_term=0


     

  
     


     




     
     
distance = 0


'''p[, r]で
長さrのタプル列、重複なしのあらゆる並びを表す
今回はリストlの重複なしの並び替え順序を新たなリストに収納している
並び方を計算しリストに収納しているイメージ
l[0,1,2]
l[0,2,1]これにもリスト番号が0,1,2と割り振られている
これが全通り入っている
これ作った人はすごい
自分も早く理解したい
'''



'''
各経路の距離を足していき全距離分を経路数
で割れば平均距離が出るので各経路ごとの距離は
不必要と判断されている。
'''



number_list=[int(i+1) for i in range(99)]

number_list.append(int(101))

number=list(map(lambda x: x* math.pow(int(100), D), number_list))
print(int(number[N-1]))

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

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

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

print(a)

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):
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())
ans=N*(100**D)
if N==100:
  ans*=1.01
print(int(ans))

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

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

else:
    cand = 100 **a

    if cand*b == 100**2:
        print(cand * b + 100)
    
    elif cand*b == 100**3:
        print(cand * b + 10000)
        
    else:
        print(cand * b)

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

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

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

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

if(N==100):
    print(101,end="")
else:
    print(N,end="")
for i in range(D):
    print("00",end="")

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

x = 100**d

ans = x*n
if n == 100:
  ans += x
print(ans)

Solution (Python):




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


if n == 100:
    wk_n = 101

ans = wk_n * (100 ** d)


print(ans)

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

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

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

Solution (Python):
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
if n == 100:
    m = 100 ** d * 101
print(m)

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

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

Solution (Python):
def main():
    D, N = (int(i) for i in input().split())
    if N == 100:
        N += 1
    print(N*(100**D))


if __name__ == '__main__':
    main()

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

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)
    if n == 100:
        print(101)
if d == 1:
    if n < 100:
        print(n * 100)
    if n == 100:
        print(10100)
if d == 2:
    if n < 100:
        print(n * 10000)
    if n == 100:
        print(1010000)

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

ans = N if N <= 99 else 101
for i in range(D):
    ans *= 100
print(ans)

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

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

Solution (Python):


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


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

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

Solution (Python):

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

def func(x):
    if x%100!=0:
        return 0
    return func(int(x/100))+1
i=1
cnt=0
while True:
    if func(i)==d:
        cnt+=1
        if cnt==n:
            print(i)
            break
    i+=1

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



i = 0
count = 0
while(True):
    i = i + 100**D
    if i % 100**D == 0 and i % 100**(D+1) != 0:
        count = count + 1
    if count >= N:
        break
    
print(i)

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

Solution (Python):
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


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


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


cntcnt = 0

for i in range(1, 10000000):
    if func(i):
        cntcnt += 1
        if cntcnt == n:
            print(i)
            exit()

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:
    print(100**d * n + 100**d)
    exit
else:
    print(100**d * n)

Solution (Python):
def readints():
    return list(map(int, input().split()))


D, N = readints()


def check(x):
    c = 0
    while x % 100 == 0:
        c += 1
        x /= 100
    return c == D


cnt = 0

for i in range(1, 10000000):
    if check(i):
        cnt += 1
        if cnt == N:
            print(i)
            exit()

Solution (Python):









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 = 101*100
else:
    if n <=99:
        ans = n*100**2
    elif n==100:
        ans = 101*100**2

print(ans)

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

n_cnt = 0
i = 0

while n_cnt < N:
  i += 1
  
  d_cnt = 0
  tmp = i
  while tmp % 100 == 0:
    tmp = tmp // 100
    d_cnt += 1
    
  if d_cnt == D:
    n_cnt += 1
    
print(i)

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

if b == 100:
  print(c * (b+1))
else:
  print(c * b)

Solution (Python):








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(1010000)

    else:

        print(val*n)

resolve()

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(N * 100)
else:
	if N == 100:
		print(1010000)
	else:
		print(N * 10000)

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

if (n == 100):
   n += 1

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

Solution (Python):
def solve():
    D, N = map(int, input().split())
    add_val = 0
    if D == 0:
        add_val = 1
    if D == 1:
        add_val = 100
    if D == 2:
        add_val = 10000

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

if __name__ == '__main__':
    solve()

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

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

div = 100 ** d

if n < 100:
    print(div * n)
    exit(0)
else:
    print(div * 101)
    exit(0)

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

Solution (Python):
D, N = [int(v) for v in input().strip().split(" ")]


def can_calc(val, d):
    cnt = 0
    while val % 100 == 0:
        val = val // 100
        cnt += 1
    return cnt == d


val = 0
vals = []
while True:
    val += 1
    if can_calc(val, D):
        vals.append(val)
    if len(vals) == N:
        break
print(vals[-1])

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

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

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

if d == 0 and n == 100:
    print(101)
elif d == 1 and n == 100:
    print(100**d * (n + 1))
elif d == 2 and n == 100:
    print(100**d * 101)
else:
    print(100**d * n)

Solution (Python):
x,y = map(int,input().split())

if y == 100:
    y += 1
print((100**x)*y)

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(101*100)
    else:
        print(N*(100**D))
else:
    if N == 100:
        print(101*(100**D))
    else:
        print(N*(100**D))

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

num=100**d
mnum=n*num
if n==100:
    mnum+=num
print(mnum)

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

Solution (Python):


import sys
input = sys.stdin.readline().rstrip

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

ans = 0
if K == 100:
    K = 101

if N == 0:
    ans = K
else:
    ans = (100 ** N) * K

print(ans)

Solution (Python):
d,n = [int(x) for x in 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)
else:
    if n == 100:
        print(101 * 10000)
    else:
        print(n * 10000)

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(pow(100,d)*n if n<100 else pow(100,d)*101)

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

ans = 100 ** D * N

if N == 100 :
    ans += 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):
def main():
    d,n = map(int, input().split())

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


if __name__ =='__main__':
    main()

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

if n < 100:
    print(pow(100, d)*n)
else:
    print(pow(100, d)*(n+1))

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

Solution (Python):
D,N=map(int, input().split())
d = 1
for i in range(D):
  d *= 100
if N==100:
  N += 1
print(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 100**d*(n+1))

Solution (Python):
D, N = map(int, input().split())
if N == 100:
    v = 101
else:
    v = N
print(v * 100**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(N * (100 ** D) if N != 100 else 101 * (100 ** D))

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

Solution (Python):
def main():
    D, N = (int(i) for i in input().split())
    if N == 100:
        N += 1
    print(N * 100**D)


if __name__ == '__main__':
    main()

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

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