#include <bits/stdc++.h>
using namespace std;
long long int Pow(long long int a, long long int b, long long int md,
                  long long int ans = 1) {
  for (; b; b >>= 1, a = a * a % md)
    if (b & 1) ans = ans * a % md;
  return ans % md;
}
const long long int MAXN = 1e6 + 10;
const long long int INF = 8e18;
const long long int MOD = 1e9 + 7;
long long int seg[MAXN << 3], P[MAXN], ind[MAXN << 2], mark[MAXN], n, m;
vector<long long int> vec;
void update(long long int pos, long long int val, long long int id = 1,
            long long int l = 0, long long int r = MAXN + MAXN) {
  if (r - l == 1) {
    seg[id] += val;
    return;
  }
  long long int mid = l + r >> 1;
  if (pos < mid)
    update(pos, val, id << 1, l, mid);
  else
    update(pos, val, id << 1 | 1, mid, r);
  seg[id] = seg[id << 1] + seg[id << 1 | 1];
}
long long int get(long long int pos, long long int id = 1, long long int l = 0,
                  long long int r = MAXN + MAXN) {
  if (r - l == 1) return l;
  long long int mid = l + r >> 1;
  if (pos > seg[id << 1])
    return get(pos - seg[id << 1], id << 1 | 1, mid, r);
  else
    return get(pos, id << 1, l, mid);
}
int main() {
  scanf("%lld%lld", &n, &m);
  for (long long int i = m + 1; i <= n + m; i++) {
    update(i, 1);
    ind[i] = i - m;
  }
  for (long long int i = m; i >= 1; i--) {
    long long int x, y, pos, t;
    scanf("%lld%lld", &x, &y);
    pos = get(y);
    t = ind[pos];
    update(pos, -1);
    if (P[t] && P[t] != x) return !printf("-1\n");
    update(i, 1);
    P[t] = x;
    ind[i] = t;
  }
  for (long long int i = 1; i <= n; i++) {
    mark[P[i]]++;
  }
  for (long long int i = 1; i <= n; i++)
    if (mark[i] >= 2) return !printf("-1\n");
  for (long long int i = n; i >= 1; i--) {
    if (mark[i]) continue;
    vec.push_back(i);
  }
  for (long long int i = 1; i <= n; i++) {
    if (P[i])
      printf("%lld ", P[i]);
    else {
      printf("%lld ", vec.back());
      vec.pop_back();
    }
  }
  return 0;
}
