## https://yukicoder.me/problems/no/2462

class BinaryIndexTree:
    """
    フェニック木(BinaryIndexTree)の基本的な機能を実装したクラス
    """
    def __init__(self, size):
        self.size = size
        self.array = [0] * (size + 1)
    
    def add(self, x, a):
        index = x
        while index <= self.size:
            self.array[index] += a
            index += index & (-index)
    
    def sum(self, x):
        index = x
        ans = 0
        while index > 0:
            ans += self.array[index]
            index -= index & (-index)
        return ans

    def least_upper_bound(self, value):
        if self.sum(self.size) < value:
            return -1
        elif value <= 0:
            return 0

        m = 1
        while m < self.size:
            m *= 2

        k = 0
        k_sum = 0
        while m > 0:
            k0 = k + m
            if k0 < self.size:
                if k_sum + self.array[k0] < value:
                    k_sum += self.array[k0]
                    k += m
            m //= 2
        if k < self.size:
            return k + 1
        else:
            return -1

    

def main():
    N, Q = map(int, input().split())
    ist = []
    max_t = 0
    for _ in range(Q):
        i, s, t = map(int, input().split())
        ist.append((i - 1, s, t - 1))
        max_t = max(max_t, t)
    
    # imos
    array = [0] * (max_t + 1)
    for _, s, t in ist:
        array[s] += 1
        array[t + 1] -= 1
    
    a = 0
    for i in range(max_t + 1):
        a += array[i]
        array[i] = a
    
    # BIT
    bit  = BinaryIndexTree(max_t)
    for i in range(max_t + 1):
        if array[i] > 0:
            bit.add(i + 1, 1 / array[i])
    
    answer= [0] * N
    for i, s, t in ist:
        x = bit.sum(t + 1) - bit.sum(s)
        answer[i] += x

    for i in range(N):
        print(answer[i])


        

 
if __name__ == "__main__":
    main()