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=input()
b=a.split(" ")
n=int(b[0])
t=int(b[1])
num="1"
end="9"
if n>1:
    p=n-1
    for i in range(p):
        num+="0"
        end+="9"
num=int(num)
end=int(end)
for i in range(num,end+1):
    if i%t==0:
        print(i)
        break
else:
    print("-1")

    
    






    
    

    
        
    

    