#include<bits/stdc++.h>
#define maxn 500005
//#define int long long
using namespace std;
inline int read()
{
char x = getchar();
int lin = , f = ;
while(x < '' || x > '')
{
if(x == '-') f = -;
x = getchar();
}
while(x >= '' && x <= '')
{
lin = (lin << ) + (lin << ) + x - '';
x = getchar();
}
return lin * f;
}
#define PII pair<int,int>
#define fir first
#define sec second
#define ma(a,b) make_pair(a,b)
#define db double
#define inf 123123123
int son[maxn][],fa[maxn],v[maxn],rev[maxn],sz[maxn];
int rt,n,m,a[maxn],ty,le,re,tot;
#define l son[x][0]
#define r son[x][1]
void revl(int x) { swap(l,r); rev[x] ^= ; }
bool get(int x) { return son[fa[x]][] == x; }
void pb(int x) { if(rev[x]) { revl(l); revl(r); rev[x] = ; } }
void link(int now,int F,int t) { fa[now] = F; son[F][t] = now; }
void update(int x) { sz[x] = ; if(l) sz[x] += sz[l]; if(r) sz[x] += sz[r]; }
void rotate(int x,int &k)
{
int y = fa[x],z = fa[y],t = get(x);
if(k == y) k = x;
else son[z][get(y)] = x;
link(son[x][t ^ ],y,t); link(y,x,t ^ );
fa[x] = z;
update(y);
update(x);
}
void splay(int x,int &k)
{
while(x != k)
{
int y = fa[x];
if(y != k)
if(get(x) == get(y)) rotate(x,k);
else rotate(y,k);
rotate(x,k);
}
}
int find(int x,int k)
{
pb(x);
if(sz[l] + == k) return x;
if(sz[l] + < k) return find(r,k - sz[l] - );
return find(l,k);
}
int split(int x,int y)
{
x = find(rt,x);
y = find(rt,y + );
splay(x,rt); splay(y,r);
return son[y][];
}
int build(int le,int re,int F)
{
++tot;
int x = tot;
fa[x] = F;
int mid = le + re >> ;
v[x] = a[mid];
if(le < mid) l = build(le,mid - ,x);
if(re > mid) r = build(mid + ,re,x);
update(x);
return x;
}
void reverse(int x,int y) { revl(split(x,y)); }
void print(int x)
{
pb(x);
if(l) print(l);
if(v[x] != inf) printf("%d ",v[x]);
if(r) print(r);
}
signed main(){
n = read(); m = read();
for(int i = ; i <= n; i++) a[i + ] = i;
a[] = a[n + ] = inf;
rt = build(,n + ,);
for(int i = ; i <= m; i++)
{
le = read(); re = read();
reverse(le,re);
}
print(rt);
}