ccf-201709-2

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct action {
    int time;
    bool take;
    int key;
};
bool com(action a,action b) {
    if(a.time<b.time) {
        return true;
    }
    if(a.time==b.time&&a.take==false&&b.take==true) {
        return true;
    }
    if(a.time==b.time&&a.take==false&&b.take==false&&a.key<b.key) {
        return true;
    }
    return false;
}
int main() {
    int n,k,num,up,hold;
    cin>>n>>k;
    vector<action> a;
    action b;
    for(int i=0; i<k; i++) {
        cin>>num>>up>>hold;
        b.key=num;
        b.take=true;
        b.time=up;
        a.push_back(b);
        b.key=num;
        b.take=false;
        b.time=up+hold;
        a.push_back(b);
    }
    sort(a.begin(),a.begin()+a.size(),com);
    int c[n+1];
    for(int i=1; i<n+1; i++) {
        c[i]=i;
    }
    for(int i=0; i<a.size(); i++) {
//      cout<<a[i].time<<" "<<a[i].take<<" "<<a[i].key<<endl;
        if(a[i].take) {
            for(int j=1; j<n+1; j++) {
                if(c[j]==a[i].key) {
                    c[j]=0;
                }
            }
        } else {
            for(int j=1; j<n+1; j++) {
                if(c[j]==0) {
                    c[j]=a[i].key;
                    break;
                }
            }
        }
    }
    for(int i=1;i<n+1;i++){
        cout<<c[i]<<" ";
    }
    return 0;
}