Problem: 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

Solution (in PYTHON):

Solution:
# -*- coding: utf-8 -*-
def exist_divisible(number, max=10):
    for i in xrange(1, max):
        if i % number == 0: return i

    return -1


digits, divisible = map(int, raw_input().split())

if digits == 1: print exist_divisible(divisible)
else:
    repeat = digits - 1 if divisible != 10 else digits - 2
    print str(divisible) + '0' * repeat