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.math.BigInteger;
import java.util.*;
public class day53{
	public static void main(String[]args){
		Scanner input=new Scanner(System.in);
		int a=input.nextInt();
		int b=input.nextInt();
		String c="1";
		int d=0;
		for(int i=1;i<=a-1;i++)
		{
			c=c+"0";
		}
		BigInteger g,B,f,A,O;		
		g=new BigInteger(c+"0");
		
		f=new BigInteger(c);
		
		B=BigInteger.valueOf(b);
		A = BigInteger.ONE;
		O = BigInteger.ZERO;
		
		
		int t= f.remainder(B).compareTo(O);
		
		Boolean H = f.divide(g).equals(O);
		while(t!=0&&H)
		{
			
			f=f.add(A);
			
			t= f.remainder(B).compareTo(O);
			
			H = f.divide(g).equals(O);
		}
		
		H = f.divide(g).equals(O);
		if(!H)
		{
			System.out.println("-1");
		}
		else
		{
			System.out.println(f);
		}
	}
}