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
tmp = raw_input()
tmp = tmp.split(" ")
n = int(tmp[0])
t = int(tmp[1])
i = 10**(n-1)
if n == 1:
    if t == 10:
        print -1
    else:
        print t
elif n == 2:
    if t==1 or t==2 or t==5 or t==10:
        print 10
    elif t == 3 or t==4 or t == 6:
        print 12
    elif t == 7:
        print 14
    elif t==8:
        print 16
    elif t==9:
        print 18
else:
    if n == 3 and t==8:
        print 104

    elif t==1 or t==2 or t==5 or t==4 or t==8 or t==10:
        print 10**(n-1)
    elif t == 3 or t == 6:
        print 10**(n-1) + 2
    elif t == 9:
        print 10**(n-1) + 8
    elif t == 7:
        i = 10**(n - 1)
        while True:
            if i % 7 == 0:
                print i
                break
            i += 1
