#include <iostream>
#include <cstring>
#include <algorithm>

#define rep(i, a, b) for(int i = (a); i <= (b); i++)

using namespace std;

const int N = 1e5 + 10;

struct tree
{
    int s[2], p;
    int v, siz;
    int tag;
    void init(int __v, int __p)
    {
        v = __v, p = __p;
        siz = 1;
    }
}tr[N << 2];
int root, idx;
int n, m;

void pushup(int u)
{
    tr[u].siz = tr[tr[u].s[0]].siz + tr[tr[u].s[1]].siz + 1;
}

void pushdown(int u)
{
    if(tr[u].tag)
    {
        swap(tr[u].s[1], tr[u].s[0]);
        tr[tr[u].s[1]].tag ^= 1;
        tr[tr[u].s[0]].tag ^= 1;
        tr[u].tag = 0;
    }
}

void rotate(int x)
{
    int y = tr[x].p, z = tr[y].p;
    int k = tr[y].s[1] == x;
    tr[z].s[tr[z].s[1] == y] = x, tr[x].p = z;
    tr[y].s[k] = tr[x].s[k ^ 1], tr[tr[x].s[k ^ 1]].p = y;
    tr[x].s[k ^ 1] = y, tr[y].p = x;
    pushup(y), pushup(x);
}

void splay(int x, int k)
{
    while(tr[x].p != k)
    {
        int y = tr[x].p, z = tr[y].p;
        if(z != k)
        {
            if((tr[y].s[1] == x) ^ (tr[z].s[1] == y)) rotate(x);
            else rotate(y);
        }
        rotate(x);
    }
    if(!k) root = x;
}

void insert(int v)
{
    int u = root, p = 0;
    while(u) p = u, u = tr[u].s[v > tr[u].v]; 
    u = ++idx;
    if(p) tr[p].s[v > tr[p].v] = u;
    tr[u].init(v, p);
    splay(u, 0);
}

int get_k(int k)
{
    int u = root;
    while(true)
    {
        pushdown(u);
        if(tr[tr[u].s[0]].siz >= k) u = tr[u].s[0];
        else if(tr[tr[u].s[0]].siz + 1 == k) return u;
        else k -= tr[tr[u].s[0]].siz + 1, u = tr[u].s[1];
    }
    return -1;
}

void output(int u)
{
    pushdown(u);
    if(tr[u].s[0]) output(tr[u].s[0]);
    if(tr[u].v >= 1 && tr[u].v <= n) cout << tr[u].v << ' ';
    if(tr[u].s[1]) output(tr[u].s[1]);
}

int main()
{
    cin >> n >> m;
    rep(i, 0, n + 1) insert(i);
    
    while(m--)
    {
        int l, r;
        cin >> l >> r;
        
        // cout << tr[get_k(n + 1)].v << ' ' << tr[get_k(n + 2)].v << '\n';
        
        l = get_k(l), r = get_k(r + 2);
        splay(l, 0), splay(r, l);
        
        // rep(i, 2, n + 1) cout << tr[get_k(i)].v << ' ';
        // cout << '\n'; 
//         
        // cout << tr[get_k(n + 1)].v << ' ' << tr[get_k(n + 2)].v << '\n';

        tr[tr[r].s[0]].tag ^= 1;
        int son = tr[r].s[0];
    		    
        int t = get_k(n + 1), p = get_k(n + 2);
        
        tr[r].s[0] = 0;
        pushup(r), pushup(l);
    
        splay(t, 0), splay(p, t);
        tr[p].s[0] = son; 
        pushup(p), pushup(t);
        
        
    }
    output(root);
}