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

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

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

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

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

Solution (Python):
def pow100(n):
	a = 1
	for i in range(0, n):
		a = a * 100
	return a

D, N = map(int, raw_input().split())
ans = pow100(D) * N
if N == 100: ans = pow100(D+1)+pow100(D)
print ans

Solution (Python):
headerData = input().split()
d = int(headerData[0])
n = headerData[1]
if n == "100":
    n = "101"
answer = n + "00" * d
print(answer)

Solution (Python):
D, N = (int(i) for i in input().split())
A = 100 * N
B = 10000 * N
if N == 100:
  if D == 0:
    print(101)
  if D == 1:
    print(10100)
  if D == 2:
    print(1010000)
elif D == 0:
    print(N)
elif D == 1:
    print(A)
else:
    print(B)

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

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

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

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

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

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

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

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

D,N=map(int,input().split())
i=0
n=0
if N%100!=0:
    C=(100**D)*(N)
else:
    C=(100**D)*(N+1)
print(C)

Solution (Python):


def solve(D, N):
    return pow(100, D) * (N + (N//100))

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

k=n*100**d

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

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


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

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

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

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

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

cnt = 0
ans = 0

while cnt < n:
    ans += 100**d
    if ans % 100**(d+1):
        cnt+=1

print(ans)

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

if N < 100:
	print pow(100,D)*N

else:
	print (N+1)*pow(100,D)

Solution (Python):


from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


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


if __name__ == '__main__':
    main()

Solution (Python):

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

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

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

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

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

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

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


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

print(ans)

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

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

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

Solution (Python):
import sys 
import math

a, b = map(int, input().split(" "))
if b == 100:
    print(100**a*b+100**a)
else:
    print(100**a*b)

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

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

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

for i in range(B):
    if i !=99:
        a = (i+1)*100**A
    else:
        a = 101*100**A
print(a)

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

a = (100**ringo[0])*ringo[1]

if ringo[1] is 100:	
	a = (100**ringo[0])*(ringo[1]+1)

print(a)

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

Solution (Python):
D, N = map(int, input().split())
output = 1
for i in range(D):
	output *= 100
if N == 100:
	N = 101
output *= N
print(output)

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

temp = 100 ** d
res = temp * n 

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

Solution (Python):


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

    ans = 0
    
    if D == 0:
        if N == 100:
            ans = 101
        else:
            ans = N

    
    elif D == 1:
        if N == 100:
            ans = 10100
        else:
            ans = 100 * N

    
    elif D == 2:
        if N == 100:
            ans = 1010000
        else:
            ans = 10000 * N
    
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)


def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))


def to_bin(x):
    return bin(x)[2:]



dp = None

def main():
    D, N = [int(_) for _ in 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)

main()

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

Solution (Python):


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

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

Solution (Python):

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

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

print(100 ** d * n)

Solution (Python):


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

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

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

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

Solution (Python):
"""
https://abc100.contest.atcoder.jp/tasks/abc100_b
"""
[d,n]=[int(i) for i in input().split()]
if n==100:
    a=(n+1)*(100**d)
else:
    a=n*(100**d)

print(a)

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

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

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

Solution (Python):
def getinputdata():

    array_result = []    
    array_result.append(input().split(" "))

    flg = True

    try:
        while flg:

            data = input()

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = True

            else:

                flg = False
    finally:

        return array_result

arr_data = getinputdata()


d = int(arr_data[0][0])


n = int(arr_data[0][1])


if d==0 and n%100!=0:
    
    print(n)
    
elif d==0 and n%100==0:
    
    print(n+1)
    
elif d==1 and n%100!=0:
    
    print(n*100)
    
elif d==1 and n%100==0:
    
    print(n*100+100)
    
    
elif d==2 and n%100!=0:
    
    print(n*10000)
    
elif d==2 and n%100==0:
    
    print(n*10000+10000)

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

Solution (Python):
d, n = (int(i) for i in 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:
    print(101* 100 ** D)
else:
    print(100 ** D * N)

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

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

i=N
if N==100:
    i=101
if D==0:
    print(str(i))
elif D==1:
    print(str(i)+"00")
else:
    print(str(i)+"0000")

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

Solution (Python):
import math
print((lambda x: int(math.pow(100,x[0])*(x[1] if x[1]!=100 else 101)))(list(map(int, input().split()))))

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

Solution (Python):


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

lis = []
for i in range(1,101):
    if i == 100:
        lis.append(101*(100**D))
    else:
        lis.append((100**D)*i)

print(lis[N-1])

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

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 = [int(i) for i in input().split()]

number = 0

if D == 0:
    for i in range(N):
        number += 1
        if (number % 100 == 0):
            number += 1

elif D == 1:
    for i in range(N):
        number += 100
        
        if (number % 100**2) == 0:
            number += 100

else: 
    for i in range(N):
        number += 100 ** 2
        
        if (number % 100**3) == 0:
            number += 100 ** 2


print(number)

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

if k==100:
   k+=1
if n==0:
   sum=k
else:
   sum=(100**n)*k

print(sum)

Solution (Python):
D, N = list(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 * 101)
else:
    print(100 ** d * n)

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

Solution (Python):

def main():
    d, n = [int(i) for i in input().split(' ')]

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

if __name__ == '__main__':
    main()

Solution (Python):
d,n = (int(i) for i in 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*101)

else:
    print(100**D*N)

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

answer = N * (100 ** D)

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

print(answer)

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

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

if N>=100:
  N+=1

print(N*100**D)

Solution (Python):
if __name__ == '__main__':
    D, N = map(int, input().split(' '))

    if N < 100:
        print(N * 10**(2*D))
    else:
        print((N+1) * 10**(2*D))

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

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

Solution (Python):
import math

D, N = map(int,input().split())
C = 0
if(N == 100):
	C = math.pow(100,D) * 101
else:
	for i in range(1,N+1):
		C = math.pow(100,D) * i

print(int(C))

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

Solution (Python):
def f(d, n):
    add = pow(100, d)
    total = 0
    c = 0
    while True:
        total += add
        if total % pow(100, (d + 1)) == 0:
            pass
        else:
            c += 1
        if c == n:
            print(total)
            exit()


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

Solution (Python):
def process(d, n):
    if n < 100:
        return n * (100 ** d)
    else:
        return 101 * (100 ** d)

def main():
    d, n = [int(i) for i in raw_input().strip().split()]
    print process(d, n)

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

cnt = 0
Z = 0

while (cnt < N):
    Z += 100 ** D
    if (Z % (100 ** (D + 1)) != 0):
        cnt += 1

print(Z)

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

cnt = 0
index = 0
while cnt < N:
    index += 1
    if pow(100,D)*index % pow(100,D+1) == 0:
        continue
    cnt += 1

print(str(pow(100,D)*index))

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

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

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

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

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

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

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

if a ==0:
    c = str(b)
elif a ==1:
    c = str(b) + '00'
else:
    c = str(b) + '0000'
print(c)

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




def count_divisions(n):
    factors = 0
    while n%100 == 0:
        factors += 1
        n = n/100
    return factors
    
index = 0
number = 0
while index != N:
    number += 1
    if count_divisions(number) == D:
        index += 1
print(number)

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

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

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

base = 100**d
ans = base*n
if (d==0 and ans%100==0)or(d ==1 and ans%10000==0)or(d ==2 and ans%1000000==0):
    ans +=100**d
print(ans)

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

Solution (Python):
import sys


def solve(d,n):
    if  n != 100 :
        return (100**d)*n
    elif n == 100:
         return (100**d)*101 
    else:
        return n


def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

Solution (Python):
import sys

def solve(a,b):
    if a == 0 and b<=99:
        return(b)
    elif a == 1 and b<=99:
        return(100*b)
    elif a == 2 and b<=99:
        return(10000*b)
    elif a == 0:
        return(101)
    elif a == 1:
        return(10100)
    else:
        return(1010000)

def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()

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

[d,n] = x.split(' ')
if int(d) == 0:
    if int(n) == 100:
        print(101)
    else:
        print(n)
elif int(d)==1 or int(d)==2:
    if int(n) == 100:
        print((100**int(d))*(int(n)+1))
    else:
        print((100**int(d))*int(n))

Solution (Python):
import sys

def solve(a, b):
    if a == 0 or a==1 or a==2:
        if b==100:
            answer=100**a*b+(100**a)
        else:
            answer=100**a*b
    return answer

def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)

if __name__ == '__main__':
    main()

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*d)


elif d == 2:
	if(n == 100):
		print(1010000)
	else:
		print(n*10000)

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

Solution (Python):
a = input().split()
if int(a[0]) == 0:
    if int(a[1]) != 100:
        print(int(a[1]))
    else:
        print(101)
elif int(a[0]) == 1:
    if int(a[1]) != 100:
        print(int(a[1]) * 100)
    else:
        print(10100)
else:
    if int(a[1]) != 100:
        print(int(a[1]) * 10000)
    else:
        print(1010000)

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

b = int(b/100) + b
if a == 0:
    print(b)
elif a == 1:
    print(100 * b)
else:
    print(10000 * b)

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

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

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

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

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

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

Solution (Python):
D, N = [int(i) for i in input().split()]
base = pow(100, D)
print(N * base if N != 100 else 101 * base)

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

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

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

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

Solution (Python):


D,N = map(int, raw_input().split())
print (100**D)*(N + (1 if N==100 else 0))

Solution (Python):


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

l=[(100**D)*x for x in range(2*N) if (100**D)*x % (100**(D+1)) != 0]
print l[N-1]

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

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

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

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

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

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())
c = 0
for i in range(1, 2000000):
    if n == 100 and i == 100**d:
        continue
    if i % (100**d) == 0:
        c += 1
    if c == n:
        print(i)
        break

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

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

Solution (Python):


d,n=map(int,raw_input().split())
x=100**d
y=x*n
if n==100:
 print x*101
else:
 print y

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

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



if N != 100:
    if D == 0:
        print(int(1*N))
    elif D == 1:
        print(int(100*N))
    elif D == 2:
        print(int(10000 * N))

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

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

Solution (Python):



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

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

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

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

if D==0 and N<100:
  print(N)

elif D==0 and N==100:
  print(N+1)
  
elif D==1 and N<100:
  print(100*N)

elif D==1 and N==100:
  print(100*(N+1))

elif D==2 and N<100:
  print(10000*N)

elif D==2 and N==100:
  print(10000*(N+1))

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

num = 0
count = 0
while count < N:
    num += 100**D
    if num / (100**D) != 100:
        count += 1

print(num)

Solution (Python):
def solve(d, n):
    return (100**d) * (n + (n==100))

assert solve(0, 5) == 5
assert solve(1, 11) == 1100
assert solve(2, 85) == 850000
assert solve(0, 100) == 101
assert solve(1, 100) == 10100
assert solve(2, 100) == 1010000

d, n = map(int, raw_input().split())
print solve(d, n)

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

Solution (Python):
s = raw_input()
ss = s.split()
d = int(ss[0])
n = int(ss[1])
i = 1
while 1:
	x = i
	c = 0
	while x % 100 == 0:
		x //= 100
		c += 1
	if c == d:
		n -= 1
		if n == 0:
			print i
			break
	i += 1

Solution (Python):
s = input().strip()
ss = s.split()
d = int(ss[0])
n = int(ss[1])
i = 1
while 1:
	x = i
	c = 0
	while x % 100 == 0:
		x //= 100
		c += 1
	if c == d:
		n -= 1
		if n == 0:
			print(i)
			break
	i += 1

Solution (Python):
s = input().strip()
ss = s.split()
d = int(ss[0])
n = int(ss[1])
i = 1
while 1:
	x = i
	c = 0
	while x % 100 == 0:
		x //= 100
		c += 1
	if c == d:
		n -= 1
		if n == 0:
			print(i)
			break
	i += 1

Solution (Python):
s = raw_input()
ss = s.split()
d = int(ss[0])
n = int(ss[1])
i = 1
while 1:
	x = i
	c = 0
	while x % 100 == 0:
		x //= 100
		c += 1
	if c == d:
		n -= 1
		if n == 0:
			print i
			break
	i += 1

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

Solution (Python):


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

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

curr_number = 0

for i in range(1, 10**7):
	if i % (100**a) == 0 and i % (100**(a+1)) != 0:
		curr_number += 1

		if curr_number == b:
			print i
			break

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

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

Solution (Python):

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

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

Solution (Python):
def read():
    return int(input())


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


def readmap():
    return map(int, input().split())


D, N = readmap()

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

Solution (Python):

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

Solution (Python):




if __name__ == '__main__':
    d, n = list(map(int, input().split()))

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

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