#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T& x) {
  bool fu = 0;
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x);
  read(y);
  read(z);
}
inline char getc() {
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  return c;
}
const int N = 8000010;
int n, m, i, j, k, l, r, p, d, zz;
int s[N], key[N], a[N], w[N];
void upd(int i) { s[i] = s[i * 2] + s[i * 2 + 1]; }
int get(int i, int x, int y, int k) {
  if (x == y) return d = key[i], x;
  if (k <= s[i * 2])
    return get(i * 2, x, (x + y) / 2, k);
  else
    return get(i * 2 + 1, (x + y) / 2 + 1, y, k - s[i * 2]);
}
void bui(int i, int x, int y) {
  if (x != y) {
    bui(i * 2, x, (x + y) / 2);
    bui(i * 2 + 1, (x + y) / 2 + 1, y);
    upd(i);
  } else
    s[i] = (x > m);
}
void ins(int i, int x, int y, int d, bool ki) {
  if (x == y) {
    if (ki) {
      key[i] = zz, s[i] = 1;
      w[zz] = d;
    } else
      s[i] = 0;
    return;
  }
  if (d <= (x + y) / 2)
    ins(i * 2, x, (x + y) / 2, d, ki);
  else
    ins(i * 2 + 1, (x + y) / 2 + 1, y, d, ki);
  upd(i);
}
bool have[N];
int main() {
  read(n, m);
  bui(1, 1, n + m);
  memset(w, -1, sizeof(w));
  int x, y;
  l = m;
  for (int t = (1); t <= (m); t++) {
    read(x, y);
    zz = x;
    have[x] = 1;
    p = get(1, 1, n + m, y);
    if (w[x] != -1 && w[x] != p) {
      printf("-1\n");
      return 0;
    }
    if (p > m) a[p - m] = x;
    if (d > 0 && x != d) {
      printf("-1\n");
      return 0;
    }
    ins(1, 1, n + m, p, 0);
    l--;
    ins(1, 1, n + m, l, 1);
  }
  j = 1;
  for (i = 1; i <= n; i++)
    if (a[i] == 0) {
      for (; j <= n && have[j]; j++)
        ;
      a[i] = j++;
    }
  for (i = 1; i <= n; i++) printf("%d%s", a[i], i == n ? "\n" : " ");
  scanf("\n");
  return 0;
}
