import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
int[] keybord = new int[n];
for (int i = 0; i < keybord.length; i++) {
keybord[i] = i + 1;
}
int[][] teacher = new int[k][4];
for (int i = 0; i < k; i++) {
for (int j = 0; j < 3; j++) {
teacher[i][j] = sc.nextInt();
}
teacher[i][3] = teacher[i][1] + teacher[i][2];
}
// 找到最后归还钥匙的时间
int max = 0, time = 1;
for (int i = 0; i < k; i++) {
if (teacher[i][3] > max) {
max = teacher[i][3];
}
}
// 归还钥匙序列
int[] ret = new int[k];
while (time <= max) {
for (int i = 0; i < k; i++) {
if (teacher[i][3] == time) {
ret[i] = teacher[i][0];
}
}
Arrays.sort(ret);
// 归还钥匙
for (int i = 0; i < k; i++) {
if (ret[i] != 0) {
for (int j = 0; j < n; j++) {
if (keybord[j] == 0) {
keybord[j] = ret[i];
ret[i] = 0;
break;
}
}
}
}
// 借钥匙
for (int i = 0; i < k; i++) {
if (teacher[i][1] == time) {
for (int j = 0; j < n; j++) {
if (keybord[j] == teacher[i][0]) {
keybord[j] = 0;
}
}
}
}
time++;
}
for(int i=0;i<n;i++) {
System.out.print(keybord[i]+" ");
}
}
}