// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    cout << fixed << setprecision(15);
    const int MX = 1e5+10;
    int n, q;
    cin >> n >> q;
    vector<int> tot(MX+1, 0);
    vi id(q), s(q), t(q);
    FOR(q) {
        cin >> id[i] >> s[i] >> t[i];
        --id[i];
        ++s[i];
        ++t[i];
        ++tot[s[i]];
        --tot[t[i]];
    }
    FOR(MX) tot[i+1] += tot[i];
    vector<ld> val(MX+1, 0);
    FOR(MX+1) if(tot[i] != 0) val[i] = (ld)1/tot[i];
    FOR(MX) val[i+1] += val[i];

    vector<ld> ans(n);
    FOR(q) {
        ans[id[i]] += val[t[i]-1] - val[s[i]-1];
    }

    for(auto e : ans) cout << e << "\n";
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}