#include using namespace std; template class y_combinator { F f; public: y_combinator(F&& f) : f(std::forward(f)) {} template auto operator()(Args&&... args) const { return f(*this, std::forward(args)...); } }; using ll = long long; using ld = long double; template > using prique = std::priority_queue, U>; template T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); } template T ceil(T a, T b) noexcept { return floor(a + b - 1, b); } template bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); } template bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); } #define overload4(a, b, c, d, e, ...) e #define rep1(a) for (long long _i = 0; _i < (a); _i++) #define rep2(i, a) for (long long i = 0; i < (a); i++) #define rep3(i, a, b) for (long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c)) #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define pb push_back #ifndef LOCAL #define debug(...) #endif int imos[1 << 17]; ld pref[(1 << 17) + 1]; void run_case() { int N, Q; cin >> N >> Q; vector>> A(N); rep(i, Q) { int I, S, T; cin >> I >> S >> T; imos[S]++; imos[T]--; A[--I].pb({S, T}); } rep(i, 1, 1 << 17) imos[i] += imos[i - 1]; rep(i, 1 << 17) { ld t = (imos[i] ? ld(1) / imos[i] : 0); pref[i + 1] = pref[i] + t; } vector ans(N); rep(i, N) { for (auto& [l, r] : A[i]) ans[i] += pref[r] - pref[l]; cout << ans[i] << "\n"; } } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::fixed(std::cout).precision(16); int T = 1; while (T--) run_case(); return 0; }