#include<iostream>
#include<cstdio>
#include<random>
#include<chrono>
using namespace std;
constexpr int N=100005;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
struct FHQ_Treap
{
    struct Node
    {
        int ch[2];
        int val;
        unsigned int rd;
        int siz;
        int tag;
        Node()
        {
            ch[0]=ch[1]=0;
            val=0;
            rd=0;
            siz=0,tag=0;
            return;
        }
        void clear()
        {
            *this=Node();
            return;
        }
    }tree[N];
    int rt,tot;
    FHQ_Treap():rt(0),tot(0){}
    void clear()
    {
        rt=tot=0;
        return;
    }
    int new_node(int val)
    {
        int now=++tot;
        tree[now].clear();
        tree[now].val=val,tree[now].rd=rnd();
        tree[now].siz=1;
        return now;
    }
    void reverse(int u)
    {
        if(!u) return;
        tree[u].tag^=1;
        swap(tree[u].ch[0],tree[u].ch[1]);
        return;
    }
    void push_down(int u)
    {
        if(!tree[u].tag) return;
        reverse(tree[u].ch[0]);
        reverse(tree[u].ch[1]);
        tree[u].tag=0;
        return; 
    }
    void push_up(int u)
    {
        tree[u].siz=tree[tree[u].ch[0]].siz+tree[tree[u].ch[1]].siz+1;
        return;
    }
    int merge(int u,int v)
    {
        if(!u) return v;
        if(!v) return u;
        push_down(u);
        push_down(v); 
        if(tree[u].rd<tree[v].rd)
        {
            tree[u].ch[1]=merge(tree[u].ch[1],v);
            push_up(u); 
            return u;
        }
        else
        {
            tree[v].ch[0]=merge(u,tree[v].ch[0]);
            push_up(v);
            return v;
        }
    }
    void split_size(int now,int k,int &x,int &y)
    {
        if(!now)
        {
            x=y=0;
            return;
        }
        push_down(now); 
        if(k>tree[tree[now].ch[0]].siz)
        {
            x=now;
            split_size(tree[now].ch[1],k-tree[tree[now].ch[0]].siz-1,tree[x].ch[1],y);
            push_up(x);
        }
        else
        {
            y=now;
            split_size(tree[now].ch[0],k,x,tree[y].ch[0]);
            push_up(y);
        }
        return;
    }
    void insert(int val)
    {
        int x,y;
        split_size(rt,val,x,y);
        rt=merge(merge(x,new_node(val)),y);
        return;
    }
    void reverse(int l,int r)
    {
        int x,y,z;
        split_size(rt,r,x,z);
        split_size(x,l-1,x,y);
        reverse(y);
        rt=merge(merge(x,y),z);
        return;
    }
    int query(int u)
    {
        int x,y,z;
        split_size(rt,u,x,z);
        split_size(x,u-1,x,y);
        int res=tree[y].val;
        rt=merge(merge(x,y),z);
        return res;
    }
}T;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        T.insert(i);
    for(int i=1;i<=m;i++)
    {
        int l,r;
        cin>>l>>r;
        T.reverse(l,r);
    }
    for(int i=1;i<=n;i++)
        cout<<T.query(i)<<" ";
    return 0;
}