/*
  ! 以渺小启程，以伟大结束。
  ! Created: 2024/07/17 18:00:31
*/
#include <bits/stdc++.h>
using namespace std;

#define x first
#define y second
// #define int long long
#define mp(x, y) make_pair(x, y)
#define eb(...) emplace_back(__VA_ARGS__)
#define fro(i, x, y) for (int i = (x); i <= (y); i++)
#define pre(i, x, y) for (int i = (x); i >= (y); i--)
inline void JYFILE19();

typedef long long i64;
typedef pair<int, int> PII;

bool ST;
const int N = 1e6 + 10;
const int mod = 998244353;

int n, m, rt;
int ls[N], rs[N], tg[N], sz[N], rd[N];

inline void psh(int p) {
  if (p) swap(ls[p], rs[p]), tg[p] ^= 1;
}
inline void pdo(int p) {
  if (tg[p]) {
    psh(ls[p]), psh(rs[p]), tg[p] = 0;
  }
}
inline void pup(int p) {
  sz[p] = 1;
  sz[p] += sz[ls[p]];
  sz[p] += sz[rs[p]];
}
inline auto mer(int x, int y) {
  if (!x || !y) return x + y; pdo(x), pdo(y);
  if (rd[x] < rd[y]) return rs[x] = mer(rs[x], y), pup(x), x;
  return ls[y] = mer(x, ls[y]), pup(y), y;
}
inline void spl(int p, int k, int &x, int &y) {
  if (!p) return x = y = 0, void(); pdo(p);
  if (k <= sz[ls[p]]) spl(ls[p], k, x, ls[y = p]);
  else spl(rs[p], k - sz[ls[p]] - 1, rs[x = p], y); pup(p);
}
inline void rev(int l, int r) {
  int x, y, z;
  spl(rt, r, y, z);
  spl(y, l - 1, x, y);
  psh(y);
  rt = mer(x, mer(y, z));
}
inline void print(int p) {
  if (ls[p]) print(ls[p]);
  cout << p << " ";
  if (rs[p]) print(rs[p]);
}

signed main() {
  JYFILE19();
  cin >> n >> m;
  fro(i, 1, n) sz[i] = 1;
  fro(i, 1, n) rd[i] = rand();
  fro(i, 1, n) rt = mer(rt, i);
  fro(i, 1, m) {
    int l, r;
    cin >> l >> r;
    rev(l, r);
  }
  print(rt);
  return 0;
}

bool ED;
inline void JYFILE19() {
  // freopen("", "r", stdin);
  // freopen("", "w", stdout);
  srand(random_device{}());
  ios::sync_with_stdio(0), cin.tie(0);
  double MIB = fabs((&ED-&ST)/1048576.), LIM = 32;
  cerr << "MEMORY: " << MIB << endl, assert(MIB<=LIM);
}