If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`.

* The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.)
* The s_i-th digit from the left is c_i. \left(i = 1, 2, \cdots, M\right)

Constraints

* All values in input are integers.
* 1 \leq N \leq 3
* 0 \leq M \leq 5
* 1 \leq s_i \leq N
* 0 \leq c_i \leq 9

Input

Input is given from Standard Input in the following format:


N M
s_1 c_1
\vdots
s_M c_M


Output

Print the answer.

Examples

Input

3 3
1 7
3 2
1 7


Output

702


Input

3 2
2 1
2 3


Output

-1


Input

3 1
1 0


Output

-1
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner scanner = new Scanner(System.in);

		final int N = scanner.nextInt();
		final int M = scanner.nextInt();

		boolean[] flag = new boolean[N];
		boolean judge = true;
		int[] number = new int[N];

		int s, c;
		for (int i = 0; i < M; i++) {
			s = scanner.nextInt();
			c = scanner.nextInt();

			if (N > 1 && s == 1 && c == 0)
				judge = false;

			if (flag[s - 1]) {
				if (number[s - 1] != c)
					judge = false;
			} else {
				flag[s - 1] = true;
				number[s - 1] = c;
			}
		}

		if (judge) {

			if (N == 1) {
				System.out.println(number[0]);
			} else if (N == 2) {
				System.out.print(number[0] > 1 ? number[0] : 1);
				System.out.println(number[1]);
			} else if (N == 3) {
				System.out.print(number[0] > 1 ? number[0] : 1);
				System.out.print(number[1]);
				System.out.println(number[2]);
			}

		} else {
			System.out.println(-1);
		}

	}

}
