#############################################################

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations

ipt = sys.stdin.readline

def iin():
    return int(ipt())
def lmin():
    return list(map(int,ipt().split()))

MOD = 998244353
#############################################################

N,Q = lmin()
L = [lmin() for _ in range(Q)]

S = [0]*(10**5+10)
for _,s,t in L:
    S[s] += 1
    S[t+1] += -1

for i in range(1,10**5+1):
    S[i] += S[i-1]

T = []
for s in S:
    if s:
        T.append(1/s)
    else:
        T.append(0)

for i in range(1,10**5+1):
    T[i] += T[i-1]

ans = [0]*N
for i,s,t in L:
    ans[i-1] += T[t+1]-T[s]

for a in ans:
    print(a)