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):
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7


def ns(): return stdin.readline().rstrip()


def ni(): return int(ns())


def na(): return list(map(int, stdin.readline().split()))


D, N = na()
print(N * 100**D if N != 100 else 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())
n+=(n>99)
print(n*100**d)

Solution (Python):

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

tmp = []
if d == 0:
    for i in range(200):
        if i % 100 != 0:
            tmp.append(i)
    print(tmp[n - 1])
if d == 1:
    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):
def main():
    D, N = (int(i) for i in input().split())
    ans = {0: [i for i in range(1, 100)]}
    ans[0].append(101)
    ans[1] = [100*i for i in range(1, 100)]
    ans[1].append(10100)
    ans[2] = [10000*i for i in range(1, 100)]
    ans[2].append(1010000)
    print(ans[D][N-1])


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

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

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

else:
    ans = 100**D*N

print(ans)

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

Solution (Python):


import math
from collections import defaultdict

(d, n) = [int(s) for s in input().split()]

ans = 0

if d == 0:
    ans = 1
elif d == 1:
    ans = 100
else:
    ans = 10000

ans = 101 * ans if n == 100 else n * ans

print(ans)

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

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

if k == 100:
    k += 1

if d == 0:
    print(k)
elif d == 1:
    print(k * 100)
else:
    print(k * 100 ** 2)

Solution (Python):
d, n = [int(i) for i in input().split()]

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

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

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

if n != 100:
  print(A[-1])
else:
  print(101*100**d)

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=101
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(n==100): n += 1;
print(str(n) + '00' * 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):
class Solution:
    def solve(self, D: int, N: int) -> int:

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


if __name__ == '__main__':

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

    
    solution = Solution()
    print(solution.solve(D, N))

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b=INTM()
    if b==100:
        b=101
    print((100**a)*b)
if __name__ == '__main__':
    do()

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

Solution (Python):
import numpy as np

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

print(ans)

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

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

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


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


i = 0
cnt = 0
while True:
    i += 100 ** D
    if func(i) == D:
        cnt += 1

    if cnt == N:
        print(i)
        break

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

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

b = a * N
if N==100:
    print(b + pow(100, D))
else:
    print(b)

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 = list(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(N*(100**D))
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())

ans = 0
cur = 0
for i in range(1,(100**D)*N*10):
    a = i
    t = 0
    while a%100==0 and a>0:
        a//=100
        t+=1
    if t==D:
        cur += 1
    if cur == N:
        ans = i
        break
print(ans)

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

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

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())
kasu = n // 100
print(100**d * (n+kasu))

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

Solution (Python):
def main():
    D, N = map(int, input().split(" "))
    answer = 100 ** D * N
    i = 1
    flag = True
    while flag:
        if not answer % 100 ** (D + i):
            answer += 100 ** D
        else:
            flag = False
    print(answer)


if __name__ == '__main__':
    main()

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

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

Solution (Python):




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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
d, n = map(int, input().split())
if d == 0:
    if n == 100:
        print(101)
    else:
        print(1*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 solv(t):
    c = 0
    while t % 100 == 0:
        t /= 100
        c += 1
    return c

D, N = map(int, input().split())
t = 1
c = 0
while c < N:
    n = solv(t)
    if n == D:
        c += 1
    t += 1

print(t -1)

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

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

ans_list=[100**d*i for i in range(1,102)]

if n==100:
    print(ans_list[n])
else:
    print(ans_list[n-1])

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

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

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

li = []
for i in range(n):
    if i+1 == 100:
        li.append(100**d*(i+2))
    else:
        li.append(100**d*(i+1))

print(li[-1])

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

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

print(ans)

Solution (Python):
import sys

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

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

if b==100:
  b=101
  
if a==0:
  result = b
else:
  result = (100**a) * b
print(result)

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

if not(N==100):
    print(int(N*pow(100,D)))
else:
    print(int(101*pow(100,D)))

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

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

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

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

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

d, n = na()

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

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

print(m)

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

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

Solution (Python):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
d,n = map(int,input().split())
if n != 100: print((100**d)*n)
else: print((100**d)*(1+n))

Solution (Python):
import os
import sys

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

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


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

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

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

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

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

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

while True:
    ans += add
    if d == 0:
        if ans % 100 != 0:
            cnt += 1
    else:
        if ans != 0 and ans % (100 ** d) == 0 and ans % (100 ** (d + 1)) != 0:
            cnt += 1
    if cnt == n:
        break
print(ans)

Solution (Python):
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys



read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b = map(int, readline().split())
print(100 ** a * b if b != 100 else 100 ** a * (b + 1))

Solution (Python):
d,n=map(int,input().split())
li = [i * 10 ** (2*d) for i in range(2*n) if i % 100 != 0]
print(li[n-1])

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

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

Solution (Python):
from __future__ import print_function

import sys
input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return










import fractions

from fractions import gcd












from queue import Queue






from operator import mul
from functools import reduce





def coprimize(p, q):
    common = fractions.gcd(p, q)
    return (p // common, q // common)


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom





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

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

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

Solution (Python):
a, b = map(int, raw_input().split())
ans = 1
for i in range(a):
    ans = ans * 100
if b == 100:
    print ans * 101
else:
    print ans * b

Solution (Python):
d, n = map(int, raw_input().split())
ans = 1
for i in range(d):
    ans = ans * 100
if n == 100:
    print ans * 101
else:
    print ans * n

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

Solution (Python):
d, n = map(int, input().split())
ans = 0
cnt = 0
for ans in range(1, 10000000):
    if ans % (100**(d+1)) > 0 and ans % (100 ** d) == 0:
        cnt += 1
        if (cnt == n):
            print(ans)
            exit()

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

c = pow(100, d)

if n  != 100:
    a = c * n
else:
    a = c * (n+1)

print(a)

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

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

ans = N * 100 ** D

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

print(ans)

Solution (Python):
import math
a,b = map(int, input().split(' '))
c = int(b//math.pow(100,1))
d = int(b//math.pow(100,2))

print(int((b+c+d)*math.pow(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):
d, n = map(int,input().split())

result = 0
for i in range(1,n+1):
  if i // 100 == 0:
    result = i*(100**d)
  else:  
    j = 1
    result = (i+j)*(100**d)

print(result)

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

Solution (Python):
d, n = map(int, input().split())
l = []
if 1<=n<=99:
    l.append(str(n))
    for i in range(d):
        l.append("00")
    print("".join(l))
    exit()
else:
    l.append("101")
    for i in range(d):
        l.append("00")
    print("".join(l))
    exit()

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

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


if 100*D == 0:
    number = 1
else:
    number = 100**D



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

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

if N == 100:
  N += 1

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

Solution (Python):
D, N=map(int, input().split())
if N==100:
  N=101
print(str(N)+'0'*(2*D), end='')

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):
d, n = list(map(int, input().split()))
cnt = 0
i = 1

while True:
  if(d == 0 and i % 100 != 0):
    cnt += 1    
  if(d != 0 and i % (100 ** d) == 0 and i % (100 ** (d+1)) != 0):
    cnt += 1
  if(cnt == n):
    print(i)
    exit()
  i += 1

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

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:
  C=100**A*(B+1)
else:
  C=100**A*B
print(C)

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

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

i = 0
count = 0

beki = 100 ** d

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

print(i * beki)

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

i = 0
count = 0
beki = 0

beki = 100 ** d

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

print(i * beki)

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

i = 0
count = 0
beki = 0


if d == 0:
    beki = 1
elif d == 1:
    beki = 100
else:
    beki = 10000


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

print(i * beki)

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 101*100**D)

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

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

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

print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
D,N = [int(i) for i in 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):
d, n = map(int, input().split())

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

else:
    print((100**d)*n)

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

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

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

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

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

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

Solution (Python):
D,N = map(int,input().split())
k = 100**D
m = 100**(D+1)
cnt = 0
for i in range(1,200):
  if (i*k)%m != 0:
    cnt +=1
    if cnt ==N:
      print(i*k)
      break

Solution (Python):
d,n=map(int,input().split())
a=[]
for i in range(1,2*n* 100**d):
    if i% 100**d==0 and i % 100**(d+1)!=0:
        a.append(i)
print(a[n-1])

Solution (Python):
import sys

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

def main():
    return 100 ** d * n if n < 100 else 100 ** d * 101

if __name__ == '__main__':
    ans = main()
    print(ans)

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

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

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

else:
    if n==100:
        print(10000+10000*n)
    else:
        print(10000*n)

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

cnt = 0
n = 1
while True:
    x = n * 100 ** D
    if n % 100 != 0:
        cnt += 1
    if cnt == N:
        print(x)
        exit()
    n += 1

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

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

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

if d==0 and n==100:
  print(101)
elif d==0:
  print(n)

if d==1 and n==100:
    print(10100)
elif d==1:
  print(100*n)
  
if d==2 and n==100:
    print(1010000)
elif d==2:
  print(10000*n)

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

n = 1

for i in range(1, D+1):
        n *= 100
if N == 100:
        N = 101
print(n * N)

Solution (Python):
import sys
input = sys.stdin.readline
D, N = [int(x) for x in input().split()]
ans = []
for i in range(1, 1010001):
    if i % (100 ** D) == 0 and i % (100 ** (D + 1)) != 0:
        ans.append(i)
print(ans[N-1])

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

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

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

Solution (Python):


import sys
from collections import deque

def input_data(d=""):
  t = sys.stdin.read()
  if t:
    return t
  else:
    if d[0] == "\n":
      d = d[1:]
    if d[-1] == "\n":
      d = d[:-1]    
    return d

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

if B == 100:
  B = 101

out = 100 ** A * B

print(out)

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

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

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

Solution (Python):
D, N = list(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)
    else:
        print(N*100+100)
   
else:
    if N!=100:
        print(N*10000)
    else:
        print(N*10000+10000)

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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
i = list(map(int , input().split()))
if i[1] == 100:
	i[1] = 101
print(i[1]*(100**i[0]))

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

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

tmp = 100 ** x
ans = tmp * y

if y == 100:
    ans += tmp
print(ans)

Solution (Python):

import sys
input = sys.stdin.readline


a, b = map(int, input().strip().split())

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

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

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

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

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

cnt = 0
i = 1
while True:
    if f(i) == D:
        cnt += 1
        if cnt == N:
            ans = i
            break
    i += 1

 
print(ans)

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

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

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

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

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

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