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
a,b = map(int,input().split())
c = "1"
d = 0
for i in range(a-1):
    c += "0"
c = int(c)
if a > 1:
    for i in range(c,c + 50,1):
        if i % b == 0:
            print(i)
            break
elif a <= 1:
    for i in range(1,10,1):
        if i % b == 0:
            print(i)
            d += 1
            break
    else:
        print(-1)
