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
X = list(map(int, input().split()))
print(-1 if X[0] == 1 and X[1] == 10 else 10 ** (X[0] - 1) + X[1] - (10 ** (X[0] - 1) % X[1]))

# UB_CodeForces
# Advice: Do the best you can until you know better. Then when you know better, do better.
# Location: Behind my desk next my quince lemon tea
# Caption: I see the sky as my limit
# CodeNumber: 457
