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.*;

public class Main{
  static int p = 1000000007;
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    String[] S = sc.nextLine().split(" ");
    int N = Integer.parseInt(S[0]);
    int M = Integer.parseInt(S[1]);
    int n = 0;
    if(N == 1){
      n = 10;
    }else if(N == 2){
      n = 100;
    }else{
      n = 1000;
    }
    
    char[][] val = new char[M][2];
    for(int i = 0; i < M; i++){
      S = sc.nextLine().split(" ");
      val[i][0] = S[0].charAt(0);
      val[i][1] = S[1].charAt(0);
    }
    int st = n/10;
    if(st == 1) st = 0;
    for(int i = st; i < n; i++){
      String s = i+"";
      boolean f = true;
      for(int j = 0; j < M; j++){
        int m = val[j][0]- '0' - 1;
        if(m >= s.length()) continue;
        char c = s.charAt(m);
        if(c != val[j][1]){
          f = false;
          break;
        }
      }
      if(f){
        System.out.println(i);
        return;
      }
    }
    System.out.println(-1);
  }
}