#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i,a,b) for (int i = (int)(a) ; i < (int)(b+1); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) ((int)(x).size())
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end());
using ll = long long;
using P = pair<int,int>;
using mint = modint998244353;
ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}
#ifdef LOCAL
    #include <debug.hpp>
    #define debug(...) debug::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
    #define debug(...) (static_cast<void>(0))
#endif

int main(){
    int n,q;
    cin >> n >> q;
    vector<pair<int,pair<int,int>>> ist;
    int t_max = 0;
    rep(_,q){
        int i,s,t;
        cin >> i >> s >> t;
        i--;
        ist.push_back({i,{s,t}});
        t_max = max(t_max,t);
    }
    vector<double> times(t_max+1,0);
    for(auto p : ist){
        int s = p.second.first;
        int t = p.second.second;
        times[s]++;
        times[t]--;
    }
    repn(i,1,t_max) times[i] += times[i-1];
    debug(times);
    repn(i,0,t_max) if(times[i] > 0) times[i] = 1/times[i];
    debug(times);
    repn(i,1,t_max) times[i] += times[i-1];
    debug(times);
    vector<double> ans(n,0);
    rep(i,q){
        int s = ist[i].second.first;
        int t = ist[i].second.second;
        int k = ist[i].first;
        ans[k] += times[t-1]-times[s-1];
    }
    rep(i,n) cout << fixed << setprecision(10) << ans[i] << endl;
    return 0;
}