#include<bits/stdc++.h>

#include<ext/rope>

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pii pair<int,int>

#define C 0.5772156649

#define pi acos(-1.0)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

using namespace std;

using namespace __gnu_cxx;

const double g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f;

struct Node{

    Node* ch[];

    int v;

    int s;

    int flip;

    int cmp(int x)const{

        int d = x - ch[]->s;

        if(d==)return -;

        return d<= ? :;

    }

    void maintain()

    {

        s =  + ch[]->s + ch[]->s;

    }

    void pushdown()

    {

        if(flip)//类似于线段树的lazy标记

        {

            flip=;

            swap(ch[],ch[]);

            ch[]->flip = !(ch[]->flip);

            ch[]->flip = !(ch[]->flip);

        }

    }

};

Node* null = new Node();

void Rotate(Node* &o,int d)

{

    Node* k = o->ch[d^];

    o->ch[d^] = k->ch[d];

    k->ch[d] = o;

    o->maintain();k->maintain();

    o = k;

}

void splay(Node* &o,int k)

{

    o->pushdown();

    int d = o->cmp(k);

    if(d==)k -= o->ch[]->s + ;//利用二叉树性质

    if(d!=-)

    {

        Node* p = o->ch[d];

        p->pushdown();

        int d2 = p->cmp(k);

        int k2 = (d2== ? k:k-p->ch[]->s-);

        if(d2!=-)

        {

            splay(p->ch[d2],k2);

            if(d==d2)Rotate(o,d^);

            else Rotate(o->ch[d],d);

        }

        Rotate(o,d^);

    }

}

Node* Merge(Node* left,Node* right)

{

    splay(left,left->s);//把排名最大的数splay到根

    left->ch[] = right;

    left->maintain();

    return left;

}

void split(Node* o,int k,Node* &left,Node* &right)

{

    splay(o,k);//把排名为k的节点splay到根，右侧子树所有节点排名比k大，左侧小

    right = o->ch[];

    o->ch[] = null;

    left = o;

    left->maintain();

}

struct SplayTree{

    int n;

    Node seq[N];

    Node* root;

    Node* build(int sz)

    {

        if(sz==)return null;

        Node* l=build(sz/);

        Node* o=&seq[++n];

        o->v=n;

        o->ch[]=l;

        o->ch[]=build(sz-sz/-);

        o->s = o->flip = ;

        o->maintain();

        return o;

    }

    void init(int sz)

    {

        n=;

        null->s = ;

        root = build(sz);

    }

};

vector<int>ans;

void print(Node* o)

{

    if(o!=null)

    {

        o->pushdown();

        print(o->ch[]);

        ans.pb(o->v);

        print(o->ch[]);

    }

}

void debug(Node* o)

{

    if(o!=null)

    {

        o->pushdown();

        debug(o->ch[]);

        cout<<o->v<<endl;

        debug(o->ch[]);

    }

}

SplayTree ss;

int main()

{

    int n,m;

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

    ss.init(n+);

  //  debug(ss.root);

    while(m--)

    {

        int a,b;

        scanf("%d%d",&a,&b);

        Node *o,*left,*mid,*right;

        split(ss.root,a,left,o);//把ab整体右移一位，保证不会出现0

        split(o,b-a+,mid,right);

        mid->flip^=;

        //把left+mid+right变成left+right+mid(fliped)

        ss.root = Merge(Merge(left,right),mid);

    }

    print(ss.root);

    for(int i=;i<ans.size();i++)

        printf("%d\n",ans[i]-);

    return ;

}

/************

************/