#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323846;
const long long inf = 1LL << 60;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int ctoi(const char c) {
  if ('0' <= c && c <= '9') return (c - '0');
  return -1;
}
vector<int> input(int n) {
  vector<int> vec(n);
  for (int i = 0; i < n; i++) {
    cin >> vec.at(i);
  }
  return vec;
}
vector<vector<int>> matinput(int n, int m) {
  vector<vector<int>> table(n, vector<int>(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> table.at(i).at(j);
    }
  }
  return table;
}
void matoutput(vector<vector<int>> table) {
  for (int i = 0; i < int(table.size()); i++) {
    for (int j = 0; j < int(table.at(0).size()); j++) {
      cout << table.at(i).at(j) << " ";
    }
    cout << "\n";
  }
}
long long perm(int n, int r) {
  if (n < r) {
    cout << "error"
         << "\n";
    return 0;
  }
  long long perm = 1;
  for (int i = n; i > n - r; i--) {
    perm *= i;
  }
  return perm;
}
long long comb(int n, int r) {
  if (n < r) {
    cout << "error"
         << "\n";
    return 0;
  }
  long long comb = perm(n, r);
  for (int i = r; i > 0; i--) {
    comb /= i;
  }
  return comb;
}
long long fact(int n) {
  long long fact = 1;
  for (int i = n; i > 0; i--) {
    fact *= i;
  }
  return fact;
}
int gcd(int a, int b) {
  if (a % b == 0) {
    return (b);
  } else {
    return (gcd(b, a % b));
  }
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool isprime(int n) {
  if (n < 2)
    return false;
  else if (n == 2)
    return true;
  else if (n % 2 == 0)
    return false;
  for (int i = 3; i <= sqrt(n); i += 2) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
vector<long long> divisors(long long N) {
  vector<long long> res;
  for (long long i = 1; i * i <= N; ++i) {
    if (N % i == 0) {
      res.push_back(i);
      if (N / i != i) res.push_back(N / i);
    }
  }
  sort(res.begin(), res.end());
  return res;
}
vector<pair<long long, long long>> prime_factorize(long long N) {
  vector<pair<long long, long long>> res;
  for (long long a = 2; a * a <= N; ++a) {
    if (N % a != 0) continue;
    long long ex = 0;
    while (N % a == 0) {
      ++ex;
      N /= a;
    }
    res.push_back({a, ex});
  }
  if (N != 1) res.push_back({N, 1});
  return res;
}
void Yes(bool f) {
  if (f) {
    cout << "Yes"
         << "\n";
  } else {
    cout << "No"
         << "\n";
  }
}
void YES(bool f) {
  if (f) {
    cout << "YES"
         << "\n";
  } else {
    cout << "NO"
         << "\n";
  }
}
bool leapyear(int y) {
  if (y % 4 == 0) {
    if (y % 100 == 0) {
      if (y % 400 == 0) {
        return true;
      } else {
        return false;
      }
    } else {
      return true;
    }
  } else {
    return false;
  }
}
tuple<int, int, int> dayplus(int y, int m, int d) {
  if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12) {
    if (d != 31) {
      d++;
      return make_tuple(y, m, d);
    } else {
      d = 1;
      if (m == 12) {
        m = 1;
        y++;
        return make_tuple(y, m, d);
      } else {
        m++;
        return make_tuple(y, m, d);
      }
    }
  } else if (m == 4 || m == 6 || m == 9 || m == 11) {
    if (d != 30) {
      d++;
      return make_tuple(y, m, d);
    } else {
      d = 1;
      m++;
      return make_tuple(y, m, d);
    }
  } else {
    if (leapyear(y)) {
      if (d != 29) {
        d++;
        return make_tuple(y, m, d);
      } else {
        d = 1;
        m++;
        return make_tuple(y, m, d);
      }
    } else {
      if (d != 28) {
        d++;
        return make_tuple(y, m, d);
      } else {
        d = 1;
        m++;
        return make_tuple(y, m, d);
      }
    }
  }
}
tuple<int, int, int> monplus(int y, int m, int d) {
  d = 1;
  if (m == 12) {
    m = 1;
    y++;
    return make_tuple(y, m, d);
  } else {
    m++;
    return make_tuple(y, m, d);
  }
}
bool in(vector<int> a, int x) {
  if (find(a.begin(), a.end(), x) != a.end()) {
    return true;
  } else {
    return false;
  }
}
int count_bool(vector<bool> flag) {
  int count = 0;
  for (int i = 0; i < int(flag.size()); i++) {
    if (flag[i]) {
      count++;
    }
  }
  return count;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  int n, m;
  cin >> n >> m;
  vector<pair<int, int>> s(m);
  for (int i = (0); i < (int)(m); ++i) {
    int a, b;
    cin >> a >> b;
    s[i] = make_pair(a, b);
  }
  string ans;
  if (n == 1) {
    for (int i = 0; i < 10; i++) {
      ans = to_string(i);
      bool f = true;
      for (int j = (0); j < (int)(m); ++j) {
        if (ans[s[j].first - 1] != s[j].second) {
          f = false;
        }
      }
      if (f) {
        cout << ans << "\n";
        return 0;
      }
    }
  } else if (n == 2) {
    for (int i = 10; i < 100; i++) {
      ans = to_string(i);
      bool f = true;
      for (int j = (0); j < (int)(m); ++j) {
        if (ans[s[j].first - 1] != s[j].second) {
          f = false;
          ;
        }
      }
      if (f) {
        cout << ans << "\n";
        return 0;
      }
    }
  } else {
    for (int i = 100; i < 1000; i++) {
      ans = to_string(i);
      bool f = true;
      for (int j = (0); j < (int)(m); ++j) {
        if (ctoi(ans[s[j].first - 1]) != s[j].second) {
          f = false;
        }
      }
      if (f) {
        cout << ans << "\n";
        return 0;
      }
    }
  }
  cout << -1 << "\n";
}
