#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
 
#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 100005
#define inf 0x3f3f3f3f

int n,m,rt;
mt19937 rng(1231231);

bool rev[maxn];
int ls[maxn],rs[maxn],sz[maxn];
unsigned int rnd[maxn];

void up(int p){
	sz[p]=sz[ls[p]]+sz[rs[p]]+1;
}
void pr(int p){
	rev[p]^=1;
	swap(ls[p],rs[p]);
}
void down(int p){
	if(p&&rev[p]){
		pr(ls[p]),pr(rs[p]);
		rev[p]=0;
	}
}
void split(int p,int k,int&x,int&y){
	if(!p)return x=y=0,void();
	down(p);
	if(sz[ls[p]]<k)x=p,split(rs[p],k-sz[ls[p]]-1,rs[p],y);
	else y=p,split(ls[p],k,x,ls[p]);
	up(p); 
}
int merge(int x,int y){
	if(!x||!y)return x|y;
	down(x),down(y);
	if(rnd[x]<rnd[y])return rs[x]=merge(rs[x],y),up(x),x;
	return ls[y]=merge(x,ls[y]),up(y),y;
}
void dfs(int u){
	down(u);
	if(ls[u])dfs(ls[u]);
	cout<<u<<" ";
	if(rs[u])dfs(rs[u]);
}

signed main()
{
	n=read(),m=read();
	For(i,1,n)rnd[i]=rng(),sz[i]=1,rt=merge(rt,i);
	For(i,1,m){
		int l=read(),r=read();
		int x,y,z;
		split(rt,l-1,x,y);
		split(y,r-l+1,y,z);
		pr(y);
		rt=merge(x,merge(y,z));
	}
	dfs(rt);
	return 0;
}