#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30), M = 1e5+1;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,q;
    cin >> n >> q;
    vector<int> imos(M+1,0);
    vector<int> x(q), s(q), t(q);
    rep(i,q){
        cin >> x[i] >> s[i] >> t[i];
        s[i]++; t[i]++; x[i]--;
        imos[s[i]]++; imos[t[i]]--;
    }
    vector<ld> tot(M+1,1), ans(n,0);
    rep(i,M) imos[i+1] += imos[i];
    rep(i,M+1) if(imos[i]) tot[i] /= imos[i];
    rep(i,M) tot[i+1] += tot[i];
    rep(i,q) ans[x[i]] += tot[t[i]-1] - tot[s[i]-1];
    cout << fix(16);
    rep(i,n) cout << ans[i] << '\n';
    return 0;
}