/* fhq-treap.cpp */
#include <bits/stdc++.h>

using i64 = long long;
std::mt19937 rnd;
struct Node {
    Node *l = nullptr, *r = nullptr;
    int s = 0, v = 0; bool t = false; unsigned w = rnd();
} *null;
Node *newNode(int v) { return new Node{null, null, 1, v, false, rnd()}; }
void pull(Node *u) { u->s = 1 + u->l->s + u->r->s; }
void apply(Node *u) {
    std::swap(u->l, u->r), u->t ^= 1;
}
void push(Node *u) {
    if (u->t) apply(u->l), apply(u->r), u->t = false;
}
void split(Node *u, int p, Node *&x, Node *&y) {
    if (u == null) return x = y = null, void();
    push(u);
    if (p <= u->l->s) y = u, split(u->l, p, x, y->l), pull(u);
    else x = u, split(u->r, p - u->l->s - 1, x->r, y), pull(u);
}
Node *merge(Node *u, Node *v) {
    if (u == null || v == null) return u == null ? v : u;
    push(u), push(v);
    if (u->w < v->w) return u->r = merge(u->r, v), pull(u), u;
    else return v->l = merge(u, v->l), pull(v), v;
}
void print(Node *u) {
    if (u == null) return;
    print(u->l), std::cout << u->v + 1 << ' ', print(u->r);
}

int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);

    null = new Node{}, null->l = null->r = null, null->s = 0;

    int n, q; std::cin >> n >> q;

    Node *rt = null;
    for (int i = 0; i < n; ++i) rt = merge(rt, newNode(i));

    while (q--) {
        int l, r; std::cin >> l >> r, --l;
        Node *x, *y, *z;
        split(rt, r, y, z), split(y, l, x, y), apply(y);
        rt = merge(merge(x, y), z);
    }

    print(rt);

    return 0;
}