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.HashMap;
import java.util.Map;
import java.util.Scanner;

// https://atcoder.jp/contests/abc157/tasks/abc157_c
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();

		boolean flag = true;
		HashMap<Integer, Integer> map = new HashMap<>();
		for (int i = 0; i < M; i++) {
			int s = sc.nextInt();
			int c = sc.nextInt();
			if (map.containsKey(s)) {
				if (map.get(s) != c) {
					flag = false;
				}
			} else {
				if (s == 1 && c == 0 && N >= 2) {
					flag = false;
				} else {
					map.put(s, c);
				}
			}
		}
		sc.close();

		Integer[] ans = { -1, -1, -1 };
		for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
			ans[entry.getKey() - 1] = entry.getValue();
		}

		if (flag) {
			for (int i = 0; i < N; i++) {
				if (ans[i] >= 0) {
					System.out.print(ans[i]);
				} else {
					if (i == 0) {
						if (N == 1) {
							System.out.print("0");
						} else {
							System.out.print("1");
						}
					} else {
						System.out.print("0");
					}
				}
			}
//			System.out.println();

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