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
import java.util.*;
import java.math.BigInteger;

public class LearnFromMaths
{
    static BigInteger sqrt(BigInteger n)
	{
		Double d=Math.sqrt(n.doubleValue());
		n=BigInteger.valueOf(d.longValue());
		return n;
	}

	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		BigInteger k = new BigInteger(1+"");
		BigInteger sum = new BigInteger(0+"");
		BigInteger p = new BigInteger(10+"");
		long x = 0;
		int t, a;
	
			a = in.nextInt();
			t = in.nextInt();
			a--;
			p = p.pow(a);
			if(a==0 && t== 10){
				System.out.println("-1");
			}
			else {
				
			for(int i=1; ; i++){
				if(p.mod(BigInteger.valueOf(t)).compareTo(sum)==0){
					System.out.println(p);
					x=1;
					break;
				}
				p = p.add(k);
			}
			}
			
		in.close();
	}
}