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
"""
Codeforces Round #324 (Div. 2)

Problem 584 A Olesya and Rodion

@author yamaton
@date 2015-11-11
"""

import itertools as it
import functools
import operator
import collections
import math
import sys


def solve(n, t):
    count = (10**n - 1) // t -  (10**(n-1) - 1) // t
    if count == 0:
        return -1
    else:
        return (10**n -1) // t * t


def p(*args, **kwargs):
    return print(*args, file=sys.stderr, **kwargs)

def main():
    [n, t] = [int(c) for c in input().strip().split()]
    result = solve(n, t)
    print(result)


if __name__ == '__main__':
    main()
