import bisect

import os

from collections import Counter, deque

from fractions import gcd

from functools import lru_cache

from functools import reduce

import functools

import heapq

import itertools

import math

import numpy as np

import re

import sys



if os.getenv("LOCAL"):

    sys.stdin = open("_in.txt", "r")



sys.setrecursionlimit(2147483647)

INF = float("inf")



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



if N == 100:

    N += 1

print((100 ** D * N))



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

# MOD = 998244353



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



if n == 100:

    n += 1

ans = 100 ** d * n

print(ans)

import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
D, N = list(map(int, sys.stdin.readline().split()))
if N == 100:
    N += 1
print((100**D * N))

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
# MOD = 998244353
d, n = list(map(int, sys.stdin.buffer.readline().split()))
if n == 100:
    n += 1
ans = 100**d * n
print(ans)

-import bisect -from collections import Counter, deque -from fractions import gcd -from functools import lru_cache -from functools import reduce -import functools -import heapq -import itertools -import math -import numpy as np -import re -sys.setrecursionlimit(2147483647) +sys.setrecursionlimit(10**9) -D, N = list(map(int, sys.stdin.readline().split())) -if N == 100: -    N += 1 -print((100**D * N)) +IINF = 10**18 +MOD = 10**9 + 7 +# MOD = 998244353 +d, n = list(map(int, sys.stdin.buffer.readline().split())) +if n == 100: +    n += 1 +ans = 100**d * n +print(ans)