#include <cstdio>

 #include <cstring>

 #include <algorithm>

 #define N 100100

 #define il inline

 #define ll long long

 #define root d[0].ch[1]

 #define con(x,ff,p) d[x].fa=ff,d[ff].ch[p]=x

 #define idf(x) d[d[x].fa].ch[0]==x?0:1

 #define lb(x) (x&(-x))

 using namespace std;

 int n,m,cnt;

 struct SPLAY{

     int fa,ch[],id,sum,mrk;

 }d[N<<];

 il void pushup(int x) {d[x].sum=d[d[x].ch[]].sum+d[d[x].ch[]].sum+;}

 il void pushdown(int x)

 {

     if(!d[x].mrk) return;

     swap(d[x].ch[],d[x].ch[]);

     d[x].mrk=;

     d[d[x].ch[]].mrk^=;

     d[d[x].ch[]].mrk^=;

 }

 il void rot(int x)

 {

     int y=d[x].fa;int ff=d[y].fa;

     int px=idf(x);int py=idf(y);

     con(d[x].ch[px^],y,px);

     con(y,x,px^);

     con(x,ff,py);

     pushup(y),pushup(x);

 }

 void splay(int x,int to)

 {

     to=d[to].fa;

     int y,px,py;

     while(d[x].fa!=to)

     {

         y=d[x].fa;

         px=idf(y),py=idf(x);

         if(d[y].fa==to) rot(x);

         else if(py==px){

             rot(y);

             rot(x);

         }else{

             rot(x);

             rot(x);

         }

     }

 }

 int Find(int w)

 {

     int x=root;

     while(x)

     {

         pushdown(x);

         if(d[d[x].ch[]].sum>=w)

         {

             x=d[x].ch[];

             continue;

         }

         w-=d[d[x].ch[]].sum;

         if(w==) return x;

         w--,x=d[x].ch[];

     }

     return ;

 }

 int build(int ff,int l,int r)

 {

     if(l>r) return ;

     int x=++cnt;

     int mid=(l+r)>>;

     d[x].id=mid-,d[x].fa=ff,d[x].sum=;

     d[x].ch[]=build(x,l,mid-);

     d[x].ch[]=build(x,mid+,r);

     pushup(x);

     return x;

 }

 void Print(int x)

 {

     pushdown(x);

     if(d[x].ch[]) Print(d[x].ch[]);

     if(d[x].id!=&&d[x].id!=n+) printf("%d ",d[x].id);

     if(d[x].ch[]) Print(d[x].ch[]);

 }

 int main()

 {

     //freopen("testdata.in","r",stdin);

     scanf("%d%d",&n,&m);

     int x,y;

     root=build(,,n+);

     for(int i=;i<=m;i++){

         scanf("%d%d",&x,&y);

         if(x==y) continue;

         int xx=Find(x);

         splay(xx,root);

         int yy=Find(y+);

         splay(yy,d[root].ch[]);

         d[d[d[root].ch[]].ch[]].mrk^=;

     }

     Print(root);

     return ;

 }