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

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

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

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

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

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

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

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

li = [(100**D)*i for i in range(200) if ((100**D)*i)%(100**(D+1)) != 0]

print(li[N-1])

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

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

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

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

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

Solution (Python):



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

if __name__=="__main__":
    solve()

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

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

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

if 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):
str =  input()
d,n = str.split(" ")

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

Solution (Python):
d,n = map(int,raw_input().split())
x = 100**d
ans = 0
for a in range(n):
  ans += x
if n == 100:
  ans += x
print ans

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

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

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

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

ns = list(filter(lambda x: x % 100 != 0, range(1, 102)))
print(ns[n-1]*100**d)

Solution (Python):

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

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

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

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

Solution (Python):
D, N = map(int, input().split())
if 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):
import math
 
d,n = [int(x) for x in input().split()]
result = int(math.pow(100,d)*n)
if(n == 100):
    result += int(math.pow(100,d))

print(result)

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

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

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

Solution (Python):
d,n = map(int,raw_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(pow(100, D)*N)
else:
    print(pow(100, D)*(N+1))

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

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

Solution (Python):
import sys

cin = sys.stdin



def line2N():
    return map(int, cin.readline().split())


D, N = line2N()
if N==100:
    N = 101

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

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

Solution (Python):
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

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

def reads():
  return [int(x) for x in input().split()]

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

Solution (Python):
from sys import stdin
n,k = map(int,stdin.readline().split())
if k==100:
    k = 101 
print k * (100**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=[int(i) for i in input().split(" ")]
num=1
i=1
while i<N:
    num+=1
    if num%100!=0:
        i+=1

print(num*(100**D))

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

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

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

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

if N == 100:
    N += 1

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

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

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

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

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

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

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

print(int(n)*100**int(d))

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

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

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

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

Solution (Python):


def main():
    a, b = list(map(int, raw_input().split()))
    if b < 100:
        print(100 ** a * b)
    else:
        print(100 ** a * 101)


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys, math
from sys import stdin, stdout

rem = 10 ** 9 + 7
sys.setrecursionlimit(10 ** 6)
take = lambda: map(int, stdin.readline().split())

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

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

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

Solution (Python):
from sys import stderr
from functools import reduce
from operator import add
def f(): return [int(i) for i in input().split()]
def debug(*x): stderr.write(reduce(add,repr(x)).strip("()\',")+'\n')

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

Solution (Python):


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

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

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

if(D==2):
    if(N!=100):
        print(100*100*N)
    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):
def ketanowa(p):
    ans = 0
    p = str(p)
    for i in p:
        ans += int(i)
    return ans


def main():
    temp1 = input()
    temp1 = temp1.split(" ")
    n1 = int(temp1[0])
    n2 = int(temp1[1])
    if n2!=100:
        print((100**n1) * n2)
    else:
        if n1==0:
            print(101)
        if n1==1:
            print(10100)
        if n1==2:
            print(1010000)

if __name__ == '__main__':
    main()

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

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

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

suffix = "00" * d
if n == 100:
    print "101" + suffix
else:
    print str(n) + suffix

Solution (Python):
'''input
2 100
'''
from math import pow
d,n = map(int,raw_input().split())
if n!= 100:
	print int(n*pow(100,d))
if n == 100:
	print int((n+1)*pow(100,d))

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

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] = [int(x) for x in input().split()]
N = N if N != 100 else 101
print(100 ** D * N)

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

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

Solution (Python):


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

base = 1
for _ in range(d):
    base *= 100

if n == 100:
    n += 1

print(base * n)

Solution (Python):
def main():
    D, N = map(int, raw_input().split())
    if N<100:
        result = N*100**D
    else:
        result = (N+1)*100**D
    print(result)


if __name__ == '__main__':
    main()

Solution (Python):

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

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

Solution (Python):


import math
import sys
import itertools
import numpy as np

d,n = map(int, input().split())
answer = n
if n == 100:
    answer=101
for i in range(d):
    answer = answer * 100

print(answer)

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

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

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

Solution (Python):
D,N=map(int,input().split())
a,b,c=[],[],[]
i=1
while len(a)<100:
	if i%100!=0:
		a.append(i)
	i+=1
i=100
while len(b)<100:
	if i%100==0:
		j=i//100
		if j%100!=0:
			b.append(i)
	i+=100
i=10000
while len(c)<100:
	if i%10000==0:
		j=i//10000
		if j%100!=0:
			c.append(i)
	i+=10000
if D==0:
	print(a[N-1])
elif D==1:
	print(b[N-1])
else:
	print(c[N-1])

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

Solution (Python):
d,n = (int(i) for i in input().split())
if n==100:
	if d==0: print(101)
	elif d==1: print(10100)
	else: print(1010000)
else: print(int(str(n)+"0"*(2*d)))

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

ANS = pow(100,D)*N

if D==0 and N==100:
    print(ANS+pow(100,D))
elif D==1 and N==100:
    print(ANS+pow(100,D))
elif D==2 and N==100:
    print(ANS+pow(100,D))
else:
    print(ANS)

Solution (Python):


import sys,collections,itertools,re,math,fractions,decimal,random,array,bisect,heapq





def solve(f):
    d, n = f.read_int_list()
    if n == 100: n = 101
    return n * 100**d


class Reader(object):
    def __init__(self, filename=None):
        self.file = open(filename) if filename is not None else None
        self.case = 1

    def __readline(self):
        return self.file.next().strip() if self.file else raw_input()

    def next_case(self):
        self.file.next()
        self.case += 1

    def read_int(self): return int(self.__readline())
    def read_float(self): return float(self.__readline())
    def read_long(self): return long(self.__readline())
    def read_decimal(self): return decimal.Decimal(self.__readline())
    def read_str(self): return self.__readline()

    def read_int_list(self): return map(int, self.__readline().split())
    def read_float_list(self): return map(float, self.__readline().split())
    def read_long_list(self): return map(long, self.__readline().split())
    def read_decimal_list(self): return map(decimal.Decimal, self.__readline().split())
    def read_str_list(self): return self.__readline().split()

if __name__ == '__main__':
    filename = sys.argv[1] if len(sys.argv) > 1 else None
    f = Reader(filename)
    if f.file:
        while True:
            print "Case 
            try:
                f.next_case()
            except StopIteration:
                break
    else:
        print solve(f)

Solution (Python):


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

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

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

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

print(n)

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

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

zero = ''
for _ in range(D):
    zero += '00'

if N == 100:
    N += 1
        
print(str(N) + zero)

Solution (Python):
inp = input().split()

d = int(inp[0])
n = int(inp[1])
if n==100: n+=1

print(100**d * n)

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

if N == 100:
  N = 101
print(str(N) + ('00' * D))

Solution (Python):
from itertools import count, islice

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

gen = (i * (100**d) for i in count(1) if i % 100 != 0)
print(next(islice(gen, n-1, n)))

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

    if n == 100:
        n = 101

    print(100**d*n)


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):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    d,n = LI()
    if n < 100:
        return 100**d*n
    return 100**d*(n+1)


print(main())

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

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

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

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

if N == 100:
  N = 101
print(str(N) + ('00' * D))

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

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

if N == 100:
  N = 101
print(str(N) + ('00' * D))

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

Solution (Python):
def read_ints():
    return [int(c) for c in input().split()]


def count(x):
    ret = 0
    while x % 100 == 0:
        ret += 1
        x //= 100
    return ret


def main():
    d, n = read_ints()
    print(list(x for x in range(1, 2000000) if count(x) == d)[n-1])


if __name__ == '__main__':
    main()

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

d, n = na()

x = 1
for i in range(d):
    x *= 100
if n == 100:
    n += 1
print(n*x)

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(str(N) + ('00' * D))

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

n = N
if n == 100:
    n += 1

r = n * 100 ** D

print(r)

Solution (Python):



d,n = [int(i) for i in 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(101*100**D)