n,q = map(int,input().split())
lr = [[int(i)-1 for i in input().split()] for j in range(q)]

lr.sort(key=lambda x:x[2], reverse=True)

li = [10**9]*n
s = [i for i in range(n)]
s = set(s)
#print(s)

for i in range(q):
    l,r,b = lr[i]
    for j in range(r-l+1):
        if l+j in s:
            s.remove(l+j)
            li[l+j] = b+1
print(*li)