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
#include <bits/stdc++.h>
using namespace std;
int a[2000001], b[2000001];
int main() {
  char ch[2000001];
  int i, n, k = 1000, m = 0, t = 0, j = 0;
  int l = 0, r, x, ans = 0, c = 0;
  cin >> n >> m;
  if (n == 1 && m == 10) {
    cout << "-1";
    return 0;
  }
  if (m == 10) {
    for (i = 1; i < n; i++) cout << "1";
    cout << "0";
    return 0;
  }
  for (i = 1; i <= n; i++) {
    cout << m;
  }
  return 0;
}
