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
from  bisect import bisect_right as br
import sys
from collections import *
from math import *
import re
def sieve(n):
    prime=[True for i in range(n+1)]
    p=2
    while p*p<=n:
        if prime[p]==True:
            for i in range(p*p,n+1,p):
                prime[i]=False
        p+=1
    c=0
    for i in range(2,n):
        if prime[i]:
            #print(i)
            c+=1
    return c
def totient(n):
    res,p=n,2
    while p*p<=n:
        if n%p==0:
            while n%p==0:
                n=n//p
            res-=int(res/p)
        p+=1
    if n>1:res-=int(res/n)
    return res
    

def iseven(n):return[False,True][0 if n%2 else 1]
def inp_matrix(n):return list([input().split()] for i in range(n))
def inp_arr():return list(map(int,input().split()))
def inp_integers():return map(int,input().split())
def inp_strings():return input().split()
def lcm(a,b):return (a*b)/gcd(a,b)
max_int = sys.maxsize
mod = 10**9+7
flag1=False
flag2=False

n,t=inp_integers()
a,b=[int('1'+'0'*(n-1)),1][n==1],int('9'*(n))
for i in range(a,b+1):
    if i%t==0:
        flag1=True;break
print([-1,i][flag1==True])