#include<bits/stdc++.h>

using namespace std;

const int N = 1e5 + ;

namespace IO

{

    const int Maxlen = N * ;

    char buf[Maxlen], *C = buf;

    int Len;

    inline void read_in()

    {

        Len = fread(C, , Maxlen, stdin);

        buf[Len] = '\0';

    }

    inline void fread(int &x)

    {

        x = ;

        int f = ;

        while (*C < '' || '' < *C) { if(*C == '-') f = -; ++C; }

        while ('' <= *C && *C <= '') x = (x << ) + (x << ) + *C - '', ++C;

        x *= f;

    }

    inline void fread(long long &x)

    {

        x = ;

        long long f = ;

        while (*C < '' || '' < *C) { if(*C == '-') f = -; ++C; }

        while ('' <= *C && *C <= '') x = (x << ) + (x << ) + *C - '', ++C;

        x *= f;

    }

    inline void read(int &x)

    {

        x = ;

        int f = ; char c = getchar();

        while(c < '' || c > '') { if(c == '-') f = -; c = getchar(); }

        while(c >= '' && c <= '') { x = (x << ) + (x << ) + c - ''; c = getchar(); }

        x *= f;

    }

    inline void read(long long &x)

    {

        x = ;

        long long f = ; char c = getchar();

        while(c < '' || c > '') { if(c == '-') f = -; c = getchar(); }

        while(c >= '' && c <= '') { x = (x << 1ll) + (x << 3ll) + c - ''; c = getchar(); }

        x *= f;

    }

} using namespace IO;

struct node {

    int f, rev, sz;

    int ch[];

} t[N];

int n, m, root;

int ans[N], size[N];

void update(int x)

{

    t[x].sz = t[t[x].ch[]].sz + t[t[x].ch[]].sz + ;

}

bool wh(int x)

{

    return x == t[t[x].f].ch[];

}

void pushdown(int x)

{

    if(!t[x].rev) return;

    t[t[x].ch[]].rev ^= ;

    t[t[x].ch[]].rev ^= ;

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

    t[x].rev = ;

}

void up(int x)

{

    if(t[x].f) up(t[x].f);

    pushdown(x);

}

int build(int l, int r, int f)

{

    if(l > r) return ;

    int mid = (l + r) >> ;

    t[mid].f = f;

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

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

    update(mid);

    return mid;

}

void rotate(int x)

{

    int f = t[x].f, w = wh(x);

    t[x].f = t[f].f;

    t[t[f].f].ch[wh(f)] = x;

    t[f].ch[w] = t[x].ch[w ^ ];

    t[t[x].ch[w ^ ]].f = f;

    t[x].ch[w ^ ] = f;

    t[f].f = x;

    update(f);

    update(x);

}

inline void splay(int x, int tar)

{

    for(; t[x].f != tar; rotate(x))

        if(t[t[x].f].f != tar)

            rotate(wh(x) == wh(t[x].f) ? t[x].f : x);

    if(!tar) root = x;

}

int find(int x, int k)

{

    pushdown(x);

    if(t[t[x].ch[]].sz +  == k) return x;

    if(k <= t[t[x].ch[]].sz) return find(t[x].ch[], k);

    return find(t[x].ch[], k - t[t[x].ch[]].sz - );

}

int split(int l, int r)

{

    int x = find(root, l - ), y = find(root, r + );

    splay(x, );

    splay(y, root);

    return y;

}

void dfs(int u)

{

    if(!u) return;

    pushdown(u);

    dfs(t[u].ch[]);

    ans[++ans[]] = u;

    dfs(t[u].ch[]);

}

int main()

{

    read_in();

    fread(n);

    fread(m);

    root = build(, n + , );

    while(m--)

    {

        int A, B, C;

        fread(A);

        fread(B);

        fread(C);

        int x = split(A + , A + B + ), y = t[x].ch[];

        t[y].rev ^= ;

        t[y].f = t[x].ch[] = ;

        update(x);

        update(t[x].f);

        int z = split(C + , C + );

        t[y].f = z;

        t[z].ch[] = y;

        update(z);

        update(t[z].f);

    }

    dfs(root);

    for(int i = ; i < ans[]; ++i) printf("%d ", ans[i] - );

    return ;

}