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.



Sample input:
0 5


Sample output:
5

Submission status: Wrong Answer

Solution code:
from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

d,n = inpl()
print(n*100**d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = (int(x) for x in input().split())
print(n*(100**d)) if n != 100 else print(n)

Submission status: Wrong Answer

Solution code:
d, n = (int(x) for x in input().split())
print(n*(100**d))

Submission status: Wrong Answer

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

print((100**d)*n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans = 100*d

if ans==0:
    print(n)
elif ans==100:
    print(100*n)
elif ans==200:
    print(10000*n)

Submission status: Wrong Answer

Solution code:
d, n = list(map(int, input().split()))
print(100**d*n)

Submission status: Wrong Answer

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

print(n * (100 ** d))

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':

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

	num = pow(100,D)
	print(num * N)

Submission status: Wrong Answer

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

if D == 0:
    A = N
elif D == 1:
    A = N * 100
else:
    A = N * 10000
    
print(A)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
print(n*[1,100,10000][d])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if D == 0:
    num = 1

elif D == 1:
    num = 100

else:
    num = 10000

x = []
for i in range(1, 101):
    x.append(i * num)

print(x[N-1])

Submission status: Wrong Answer

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

ans = 0
if D == 0:
    num = 1

elif D == 1:
    num = 100

else:
    num = 10000

for i in range(N):
    ans += num

print(ans)

Submission status: Wrong Answer

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

result = 100 ** d * n

if d == 0:
    result = n
    
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((100 ** D) * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n = map(int, input().split())
l = [i*100**d for i in range(n+1)]
print(l[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


def resolve():
    (A,B)=map(int,input().split())
    print(B*(100**A))


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(100 ** d * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());print(100**a*(b+b==100))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());print(b**a*(100+b==100))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());print((100+b==100)**a*b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());print(100**a*b)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
d,k = map(int, input().split())
print(100**d*k)

Submission status: Wrong Answer

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

n = []
for i in range(1,1001):
    if D == 0:
        if i % 100 !=0:
            n.append(i)
        continue
    elif D == 1:
        if i % 100 !=0:
            n.append(100*i)
        continue      
    elif D == 2:
        n.append(10000*i)
#print(n)

print(n[N-1])

Submission status: Wrong Answer

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

n = []
for i in range(1,1001):
    if D == 0:
        if i % 100 !=0:
            n.append(i)
        continue
    elif D == 1:
        if i % 100000 !=0:
            n.append(100*i)
        continue      
    elif D == 2:
        n.append(100000*i)


print(n[N-1])

Submission status: Wrong Answer

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

n = []
for i in range(1,1001):
    if D == 0:
        if i % 100 !=0:
            n.append(i)
        continue
    elif D == 1:
        if i % 10000 !=0:
            n.append(100*i)
        continue      
    elif D == 2:
        n.append(10000*i)
#print(n)

print(n[N-1])

Submission status: Wrong Answer

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

n = []
for i in range(1,1001):
    if D == 0:
        if i % 100 !=0:
            n.append(i)
        continue
    elif D == 1:
        n.append(100*i)
    elif D == 2:
        n.append(10000*i)
#print(n)

print(n[N-1])

Submission status: Wrong Answer

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

n = []
for i in range(1,1001):
    if D == 0:
        n.append(i)
    elif D == 1:
        n.append(100*i)
    elif D == 2:
        n.append(10000*i)
#print(n)

print(n[N-1])

Submission status: Wrong Answer

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

n = []
for i in range(1,1000):
    if D == 0:
        n.append(i)
    elif D == 1:
        n.append(100*i)
    elif D == 2:
        n.append(1000*i)
#print(n)

print(n[N-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

d, n = map(int, input().split())
print(n * (100 ** d))

Submission status: Wrong Answer

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

print(100 ** D * N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split());print(n*100**d if d>0 else n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
w=list(range(1,101))
if d==0:
    print(w[n-1])
elif d==1:
    print(n*100)
else:
    print(n*10000)

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split())
w=list(range(1,101))
if d==0:
    print(w[n-1])
elif d==1:
    print(n*100)
elif d==2:
    print(n*10000)

Submission status: Wrong Answer

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

print(str((100 ** D) * N))

Submission status: Wrong Answer

Solution code:
d,n = (int(i) for i in input().split())
print(100**d*n)

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

print(100 ** D * N)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a == 0:
  print(b)
elif a == 1:
  print((b+(b*100)//10000)*100)
else:
  print((b+(b*10000)//1000000)*10000)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a == 0:
  print(b)
elif a == 1:
  print(b*100)
else:
  print(b*10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N=list(map(int, input().split()))
b=100**D
a=b*N
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
print(str(N)+'00'*D)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = [int(x) for x in input().split()]
print(100**A*B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    d,n=map(int,input().split())
    print(n*(100**d))
resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = map(int, input().split())
ans = 0
for i in range(n):
    ans += 100 ** d

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys


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

if D == 0:
    print(N)
else:
    cnt = 0
    n = 1
    while cnt < N:
        val = n/100**D
        n += 1
        if val.is_integer():
            cnt += 1
    else:
        print(n-1)

Submission status: Wrong Answer

Solution code:
import sys


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

cnt = 0
if D == 0:
    print(N)
else:
    for n in range(1, 1000000):
        val = n/100**D
        if val.is_integer():
            cnt += 1
            if cnt == N:
                print(n)
                sys.exit()

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
a = 100**a
print(a*b)

Submission status: Wrong Answer

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

d=[1,100,10000]

if N!=100**D:
    print(d[D]*N)
else:
    print(d[D]*N-1)

Submission status: Wrong Answer

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

d=[1,100,10000]

if N!=10*D:
    print(d[D]*N)

Submission status: Wrong Answer

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

d=[1,100,10000]

print(d[D]*N)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
d=[1,100,10000]
if N==10*d[D]:
    N-=1
print(1*d[D]*N)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
d=[1,100,10000]
print(1*d[D]*N)

Submission status: Wrong Answer

Solution code:
D,N = map(int,input().split())
d=[1,100,10000]
print((1*d[D])*N)

Submission status: Wrong Answer

Solution code:
[D, N] = map(int, input().split())
print(100**D*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print((pow(100,a))*b)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print(pow(100,a)*b)

Submission status: Wrong Answer

Solution code:
D,N = map(int, input().strip().split(' '))
print(N*(100**D))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(100**a*b)

Submission status: Wrong Answer

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

print((100**D)* N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
s = 100**D
r = s
while N > 0:
    r += s
    if r%100 != 0:
        continue
    N -= 1
print(r - s)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
s = 100**D
r = s
while N > 0:
    r += s
    N -= 1
print(r - s)

Submission status: Wrong Answer

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

print((100**D)*N)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

X = 100**D * N

print(int(X))

Submission status: Wrong Answer

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

X = 100 **D * N

print(X)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d, n = list(map(int, input().split()))
print(100 ** d * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
a=[i*(100**D) for i in range(1,1000) if i%(100**(D+1))!=0]
print(a[N-1])

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
a=[i*(10**D) for i in range(1,1000) if i%(100**(D+1))!=0]
print(a[N-1])

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
a=[i*(10**D) for i in range(0,102) if i !=100]
print(a[N])

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline

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

a = 100 ** A
c = 0
for i in range(1, 2000001):
    if i % a == 0:
        c += 1

    if c == B:
        print(i)
        exit()

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline

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

ans = 0
for i in range(B):
    a = 100 ** A
    ans += a

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline

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

print(100 ** A * B)

Submission status: Wrong Answer

Solution code:
#100b
D,N = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
#100b
D,N = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
print(100 ** A * B)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(100**a*b if b != 100 or a == 2 else 100**a*(b+1))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(100**a*b if b != 100 and a != 2 else 100**a*(b+1))

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
num = 0
count = 0
for i in range(1,101):
    num += 100 ** a
    count += 1
    if count == b:
        print(num)
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
count = 0
ans = 0

while count != N:
    if D == 0:
        if N == 100:
            count += 1
            ans = count
    elif D == 1:
        count += 1
        ans = count * 100

    elif D == 2:
        count += 1
        ans = count * 10000

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
num = 0
ans = 0

while num != N:
    if D == 0:
        num += 1
        ans += 1
    elif D == 1:
        num += 1
        ans += 100
    elif D == 2:
        num += 1
        ans += 10000

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
if D==0:
    print(N)
elif D>0 and N!=100:
    print(100**D*N)
elif D>0 and N==100:
    print(100**D*101)
elif D==0 and N==100:
    print(101)

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
if D==0:
    print(N)
elif D>0 and N!=100:
    print(100**D*N)
elif D>0 and N==100:
    print(100**D*101)

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
if D==0:
    print(N)
elif D>0:
    print(100**D*N)

Submission status: Wrong Answer

Solution code:
# ABC100b
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

d, n = map(int, input().split())
print(100**d*n)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().strip().split())

print((100 ** A) * B)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(100**D + N)

Submission status: Wrong Answer

Solution code:
D,N=[int(x) for x in input().split()]
if N==100:
    print(100**D*N-1)
else:
    print(100**D*N)

Submission status: Wrong Answer

Solution code:
D,N=[int(x) for x in input().split()]
if N==100:
    print(100**D*N)
else:
    print(100**D*N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N=[int(x) for x in input().split()]
print(100**D*N)

Submission status: Wrong Answer

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

print(n*(100**d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    d, n = list(map(int, input().split()))
    print(100**d * n)
resolve()

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
if d == 0:
    if n == 100:
        print(101)
    else:
        print(n)
elif d == 1:
    if n == 100:
        print(10001)
    else:
        print(n*100)
elif d == 2:
    if n == 100:
        print(1000001)
    else:
        print(n*10000)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int, input().split())
if d == 0 and n == 100:
    print(101)
elif d == 1 and n == 100:
    print(900)
elif d == 2 and n == 100:
    print(990000)
else:
    print(100**d * n)

Submission status: Wrong Answer

Solution code:
d,n=map(int, input().split())
if d == 0 and n == 100:
    print(101)
elif d == 1 and n == 100:
    print(10001)
elif d == 2 and n == 100:
    print(1000001)
else:
    print(100**d * n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int, input().split());print(100**d * n)

Submission status: Wrong Answer

Solution code:
d,n=map(int, input().split());print(100**d*n)

Submission status: Wrong Answer

Solution code:
D,N=map(int,input().split())
ans=0
if D == 0:
	ans=N
else:
	ans=(100**D)*N

print(ans)

Submission status: Wrong Answer

Solution code:
a,b = [int(i) for i in input().split()]

print(100**a*b)

Submission status: Wrong Answer

Solution code:
d, n = input().split()
print(n + "0" * (int(d)*2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N*100**D)

Submission status: Wrong Answer

Solution code:
s = list(map(int,input().split()))

if s[0] == 0:
    if s[1] == 100:
        print('101')
    else:
        print(s[1])
elif s[0] == 1:
    if s[1] == 100:
        print('10001')
    else:
        print(s[1]*100)
elif s[0] == 2:
    if s[1] == 100:
        print('1000001')
    else:
        print(s[1]*10000)

Submission status: Wrong Answer

Solution code:
s = list(map(int,input().split()))

if s[0] == 0:
    print(s[1])
elif s[0] == 1:
    print(s[1]*100)
elif s[0] == 2:
    print(s[1]*10000)

Submission status: Wrong Answer

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

print(N * 100 ** D)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
D,N = map(int, input().split())
if D==0:
    print(int(N*1))
elif D ==1:
    print(int(N*100))
elif D ==2:
    print(int(N*10000))

Submission status: Wrong Answer

Solution code:
D,N = map(int, input().split())
if D==0:
    print(N*1)
elif D ==1:
    print(N*100)
elif D ==2:
    print(N*10000)

Submission status: Wrong Answer

Solution code:
a,b = list(map(int, input().split()))
print(round((100**a)*b) )

Submission status: Wrong Answer

Solution code:
a,b = list(map(int, input().split()))
print((100**a)*b)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ans = 100**D
for i in range(N - 1):
    ans += 100**D
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(n * 100 ** d)

Submission status: Wrong Answer

Solution code:
#インポート
import sys

#入力用
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

D, N = ISI()
print(100**D*N)

Submission status: Wrong Answer

Solution code:
n,d=map(int,input().split())
num=100**n
ans=num*d
print(ans)

Submission status: Wrong Answer

Solution code:
# ABC100 B - Ringo's Favorite Numbers 
d,n = map(int,input().split())
l = []
for i in range(1,1010000):
    t = 0
    k = i
    while i >= 100:
        if i%100 == 0:
            t +=1
        i = i//100 
    if t >= d:
        l.append(k)
print(l[n-1])

Submission status: Wrong Answer

Solution code:
# ABC100 B - Ringo's Favorite Numbers 
d,n = map(int,input().split())
l = []
for i in range(1,1010000):
    t = 0
    k = i
    while i >= 100:
        if i%100 == 0:
            t +=1
        i = i//100 
    if t == d:
        l.append(k)
print(l[n-1])

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
ans = 100**D * N
if N==100 and D!=0:
  ans +=100
print(ans)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
if D == 0:
    base = 1
elif D == 1:
    base = 100
elif D == 2:
    base = 10000
print(base * N)

Submission status: Wrong Answer

Solution code:
D, N = map(int, input().split())
print((N-(N-1)//99)*100**D)

Submission status: Wrong Answer

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

print(N,end="")
if D > 0:
    print("00" * D)
else:
    print()

Submission status: Wrong Answer

Solution code:
d,n = map(int,input().split())
 
if d == 0:
  if n == 100:
    print(101)
  else:
    print(n)
elif d == 1:
  if n == 100:
    print(10001)
  else:
    print(100*n)
elif d == 2:
  if n == 100:
    print(1000001)
  else:
    print(10000*n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
d,n=map(int,input().split());print(n*100**d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans=(100**d)*n
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=input().split(' ')
D=int(l[0])
N=int(l[1])

print(100**D*N)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
print(b * (100 ** a))

Submission status: Wrong Answer

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

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

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

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

D, K =  map(int, sys.stdin.readline().split())

if D == 0 and K == 100:
    print(100 ** (D + 1) + 1)
else:
    print(100 ** D * K)