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

import sys
input=sys.stdin.readline

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

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

if __name__=="__main__":
    main()

Solution (Python):
def answer(d: int, n: int) -> int:
    if n == 100:
        n += 1
    return 100 ** d * n


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


if __name__ == '__main__':
    main()

Solution (Python):

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

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

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

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

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

Solution (Python):

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



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

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

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

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

Solution (Python):
A,B=map(int,input().split())
if B!=100:
  print(B*(100**A))
else:
  print((B+1)*(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):
l = list(map(int, input().split()))
if l[1] != 100:
    print(l[1]*100**l[0])
else:
    print(101*100**l[0])

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

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

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

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

cnt = 0
for i in range(1, 10**7+1):
    if i%(100**d) == 0:
        cnt += 1
    if n == 100:
        if cnt == n+1:
            print(i)
            exit()
    else:
        if cnt == n:
            print(i)
            exit()

Solution (Python):
import sys

input = sys.stdin.readline

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

Solution (Python):
D,N = map(int,input().split())
base = pow(100,D)
cnt = 0
now = 0
while cnt < N:
  now += base
  if now%(base*100) != 0:
    cnt += 1
  if cnt == N:
    print(now);exit()

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

if d==0:
    if n==100:
        print('101')
    else:
        print(n)
    sys.exit()

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

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

if d==0:
    if n==100:
        print('101')
    else:
        print(n)
    sys.exit()

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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 != 0:
    ans = 100**d*n
else:
    ans = 100**d*101
print(ans)

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

Solution (Python):
a,b=map(int,input().split())
if a==0 and b==100:
    print(101)
elif a==1 and b==100:
    print(10100)
elif a==2 and b==100:
    print(1010000)
else:
    print((100**a)*b)

Solution (Python):
def solve(D, N):
    if N < 100:
        ans = 100**D * N
    else:
        ans = 100**D*101

    return ans


if __name__ == "__main__":
    D, N = map(int, input().split())
    print(solve(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())

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

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

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

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

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

Solution (Python):
def solve():
    D, N = [int(i) for i in input().split()]
    print(f"{N if N != 100 else N + 1}{'00' * D}")

if __name__ == "__main__":
    solve()

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

Solution (Python):




def resolve():
    import sys
    input = sys.stdin.readline

    d, n = [int(x) for x in input().rstrip().split(" ")]

    if n == 100:
        n = 101

    print(n * (100 ** d))


if __name__ == "__main__":
    resolve()

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

Solution (Python):
D, N = map(int, input().split())
if D > 0:
  if N < 100:
    print( N * 100**D )
  else:
    print( 101 * 100**D )
if D == 0:
  if N < 100:
    print(N)
  else:
    print(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())
'''
q = (N-1)//99
print((100*q + N - 99*q)* 100**D)
'''

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

Solution (Python):
import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
d, n = [int(num) for num in lines.pop(0).split(" ")]
if n == 100:
    n += 1
ans = (100 ** d) * n
print(ans)

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

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

Solution (Python):


def get_input() -> tuple:
    """
    標準入力を取得する.

    Returns:\n
        tuple: 標準入力
    """
    
    D, N = list(map(int, input().split()))

    return D, N


def main(D: int, N: int) -> None:
    """
    メイン処理.

    Args:\n
        D (int): 0, 1, or 2
        N (int): 整数(1 <= N <= 100)
    """
    
    ans = (N + (N // 100)) * 100**D

    
    print(ans)


if __name__ == "__main__":
    
    D, N = get_input()

    
    main(D, N)

Solution (Python):


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


ans = (N + (N // 100)) * 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):
a,b=map(int,input().split())
if b==100:
  b+=1
for i in range(a):
  b*=100
print(b)

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

ans = (100 ** D) * (N if N < 100 else 101)

print(ans)

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

Solution (Python):
D, N = map(int,input().split())
if N % 100 == 0: N += 1
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):
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())

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

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

print(X)

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

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 = [int(i) for i in input().split()]
if n == 100:
    n = 101
print((100**d) * n)

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

if b != 100:
  ans = 100 ** a * b
else:
  ans = 100 ** a * (b+1)

print(ans)

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())
n = n if n != 100 else 101
print(n * 100**d)

Solution (Python):
D, N = map(int, input().split())
if N != 100:
  if D == 0:
    print(N)
  elif D == 1:
    x = [100 * i for i in range(1, 101)]
    print(x[N-1])
  elif D == 2:
    x = [10000 * i for i in range(1, 101)]
    print(x[N-1])
else:
  if D == 0:
    print(101)
  elif D == 1:
    x = [100 * i for i in range(1, 101)]
    print(x[N-1]+100)
  elif D == 2:
    x = [10000 * i for i in range(1, 101)]
    print(x[N-1]+10000)

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

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

Solution (Python):

import sys
def input():
    return sys.stdin.readline()[:-1]

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

    if D == 0:
        ans = 0
        c = 0
        for i in range(1, 10**5, 1):
            if i % 100 != 0:
                c += 1
                ans = i
                if c == N:
                    print(ans)
                    exit()

    elif D == 1:
        ans = 0
        c = 0
        for i in range(100, 10**5, 100):
            if i % 100 == 0 and i % 10000 != 0:
                c += 1
                ans = i
                if c == N:
                    print(ans)
                    exit()

    elif D == 2:
        ans = 0
        c = 0
        for i in range(1, 10**5):
            if (i * 100**D) % 1000000 != 0:
                c += 1
                ans = i * 100**D
                if c == N:
                    print(ans)
                    exit()

if __name__ == '__main__':
    main()

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

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:
    N=101
if D==0:
    print(N*1)
    exit()
if D==1:
    print(N*100)
    exit()
if D==2:
    print(N*10000)
    exit()

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

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

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

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

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

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 == 100:
    n = 101
ans = 100 ** d * n
print(ans)

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

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

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 <= 99 else (100**d)*101)

Solution (Python):
D,N=map(int,input().split())
if N<100:
  print(100**D*N)
  exit()
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(100**2*100+10000)
  else: print(100**2*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 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)

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

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

d, n = rm()
if n != 100:
    print((n - (n-1)//99)*100**d)
else:
    print(101 * 100**d)

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

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

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

count = 0
i = 1
while count<N:
    if (i%(100**(D+1)) != 0) and (i%(100**(D+2)) != 0) and (i%(100**D)) == 0:
        count += 1
    i += 1
print(i-1)

Solution (Python):
d, n = map(int, input().split())
start = 100 ** d
counter = 0
while True:
    if start % (100 ** d) == 0 and start % (100 ** (d + 1)) != 0:
        counter += 1
    if counter == n:
        print(start)
        break
    start += 100 ** d

Solution (Python):
d, n = map(int, input().split())
start = 100 ** d
counter = 0
while True:
    if start % (100 ** d) == 0 and start % (100 ** (d + 1)) != 0:
        counter += 1
    if counter == n:
        print(start)
        break
    start += 1

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

Solution (Python):
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])

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

Solution (Python):
a = input()
b = a.split()
d = int(b[0])
n = int(b[1])
if n==100:
  print((100**d)*(n+1))
else:
  print((100**d)*n)

Solution (Python):
D,N=list(map(int, input().split()))
if N==100:
  N+=1
print(100**D*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(100*n)
else:
    if n==100:
        print(1010000)
    else:
        print(10000*n)

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

for i in range(1,1100000):
    if i%100**D==0 and i%100**(D+1)!=0:
        l.append(i)
print(l[N-1])

Solution (Python):
D,N = map(int, input().split())
ans = (N+N//100)*100**D
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=100**(D)
A=[]
for i in range(1,101):
    A.append(i*a)
if D==0:
    A.remove(100)
    A.append(101)
elif D==1:
    A.remove(10000)
    A.append(10100)
elif D==2:
    A.remove(1000000)
    A.append(1010000)
print(A[N-1])

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

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

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):
D,N=map(int,input().split())
n = 1
while True:
  if n%(100**D) == 0 and n%(100**(D+1)) != 0:
    N -= 1
  if N == 0:
    print(n)
    break
  n += 1

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

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

Solution (Python):
d, n = list(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)
else:
    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())
ans=n*(100**d)
if n ==100:
    ans+=100**d
print(ans)

Solution (Python):
import sys


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


def main():
    d, n = nm()
    if n != 100:
        print(pow(100, d) * n)
    else:
        print(pow(100, d) * 101)


if __name__ == '__main__':
    main()

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:
    n=101
print(n*(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())
ls = [0]*2000000
for i in range(1,2*10**6):
    if i % 100 == 0:
        ls[i] = 1
    if i % 10000 == 0:
        ls[i] = 2
    if i % 1000000 == 0:
        ls[i] = 3
ii = 0
for i in range(1,2*10**6):
    if ls[i] == D:
        ii += 1
    if ii == N:
        ans = i
        break
print(ans)

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

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

Solution (Python):
D,N=map(int,input().split())
i=0
c=0
while c<N:
  i+=1
  if (i*(100**D))%(100**(D+1))==0:
    continue
  c+=1
print(i*(100**D))

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

Solution (Python):


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

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

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

Solution (Python):









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

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    ans = pow(100, D)
    if N < 100:
        ans *= N
    else:
        ans *= 101

    print(ans)

    return


if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
D, N = list(map(lambda x : int(x), input().split(" ")))
print((N + int(N/100)) * (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())
print(N * 10**(2*D) if N != 100 else (N+1) * 10**(2*D))

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

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

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

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

l0 = []
for i in range(1, 102):
    if i != 100:
        l0.append(i)
l1 = []
for i in range(1, 102):
    if i != 100:
        l1.append(100 * i)
l2 = []
for i in range(1, 102):
    if i != 100:
        l2.append(10000 * i)

if D == 0:
    print(l0[N - 1])
elif D == 1:
    print(l1[N - 1])
elif D == 2:
    print(l2[N - 1])

Solution (Python):
d, n = map(int, input().split())
x = 100 ** d
y = x
cnt = 0
while cnt < n:
    if y % 100**(d+1) != 0:
        cnt += 1
    y += x
print(y-x)

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

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

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

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

Solution (Python):
a,b=(int(i) for i in input().strip().split(" "))
if b!=100:
    print(b*(100**a))
else:
    print(101*(100**a))

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


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

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

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

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

Solution (Python):
D,N=map(int,input().split())
if D == 0:
  count=0
  for i in range(1,1000):
    if i % 100 != 0:
      count += 1
    if count == N:
      print(i)
      exit()
if D == 1:
  count = 0
  for i in range(100,1000000,100):
    if i % 10000 != 0:
      count += 1
    if count == N:
      print(i)
      exit()
if D == 2:
  count = 0
  for i in range(10000,10000*10000,10000):
    if i % 1000000 != 0:
      count += 1
    if count == N:
      print(i)
      exit()

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

else:
    if n!=100:
        print(10000*n)
    else:
        print(1010000)

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

Solution (Python):
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:
    if n == 100:
        answer = 10100
    else:
        answer = 100 * n
elif d == 2:
    if n == 100:
        answer = 1010000
    else:
        answer = 10000 * n

print(answer)

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

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

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<=99:
    print(100**d*n)
else:
    print(100**d*101)

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

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

while 1:
  c += n
  if c % m == 0:
    pass
  else:
    count += 1
      
  if count == N:
    print(c)
    break

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

if d == 0:
    if n <= 99:
        print(n)
    else:
        print(101)
elif d == 1:
    if n <= 99:
        print(n*100)
    else:
        print(10100)
elif d == 2:
    if n <= 99:
        print(n*10000)
    else:
        print(1010000)

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

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

if n[1]==100:
  print((n[1]+1)*(100**n[0]))
else:
  print(n[1]*(100**n[0]))

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

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)