Olesya loves numbers consisting of n digits, and Rodion only likes numbers that are divisible by t. Find some number that satisfies both of them.

Your task is: given the n and t print an integer strictly larger than zero consisting of n digits that is divisible by t. If such number doesn't exist, print  - 1.

Input

The single line contains two numbers, n and t (1 ≤ n ≤ 100, 2 ≤ t ≤ 10) — the length of the number and the number it should be divisible by.

Output

Print one such positive number without leading zeroes, — the answer to the problem, or  - 1, if such number doesn't exist. If there are multiple possible answers, you are allowed to print any of them.

Examples

Input

3 2


Output

712
import random
n,m = [int(x) for x in input().split()]
z = []
cnt = 0
for i in range(n-1):
    z.append(random.randint(1,9))
x = ''

for i in z:
    x = x+str(i)
if len(z) == 0:
    for i in range(1, 10):
        if int((x + str(i))) % m == 0:
            print(x + str(i))
            cnt = 1
            break
else:
    for i in range(0, 10):
        if int((x + str(i))) % m == 0:
            print(x + str(i))
            cnt = 1
            break
if cnt == 0:
    print('-1')
