from collections import * import heapq import bisect import itertools class UnionFind: def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): # 多用すると重い root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): group_members = defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return "\n".join(f"{r}: {m}" for r, m in self.all_group_members().items()) dxdy = ((0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1)) INF = float("inf") MOD = 998244353 mod = 998244353 N, Q = map(int, input().split()) table = [0] * (10**5 + 2) query = [list(map(int, input().split())) for _ in range(Q)] p = [[] for _ in range(N)] for i, s, t in query: p[i - 1].append((s, t)) table[s + 1] += 1 table[t + 1] -= 1 for i in range(10**5 + 1): table[i + 1] += table[i] acc = [0] * (10**5 + 2) for i in range(10**5 + 1): acc[i + 1] = acc[i] if table[i] != 0: acc[i + 1] += 1 / table[i] ans = [0] * N # print(table[0:10]) # print(acc[0:10]) for i in range(N): for s, t in p[i]: ans[i] += acc[t + 1] - acc[s + 1] for a in ans: print(a)