#include <bits/stdc++.h>
using ll = long long;
using llu = long long unsigned;

using namespace std;
#define MOD 998244353
int main() {
    int N, Q;
    cin >> N >> Q;
    vector<int> I(Q), S(Q), T(Q);
    map<int, int> data;
    for (int i=0; i<Q; i++) {
        cin >> I[i] >> S[i] >> T[i];
        data[S[i]-1]++;
        data[S[i]]++;
        data[S[i]+1]++;
        data[T[i]-1]++;
        data[T[i]]++;
        data[T[i]+1]++;
    }

    int stop = *max_element(T.begin(), T.end());
    vector<double> meda(stop+2);
    for (auto itr=data.begin(); itr!=data.end(); itr++) {
        int tmp = itr->first;
        if (tmp < 0) { continue; }
        int cnt = 0;
        for (int i=0; i<Q; i++) {
            if (S[i]<=tmp && tmp<=T[i]) {
                cnt++;
            }
        }
        meda[tmp] = 1.0/cnt;
    }
    vector<double> ret(N, 0.0);
    for (int i=0; i<Q; i++) {
        double tmp=0.0;
        double prev=0.0;
        for (int j=S[i]; j<T[i]; j++) {
            if (meda[j]==0.0) {
                tmp+=prev;
            } else {
                tmp += meda[j];
                prev = meda[j];
            }
        }
        ret[I[i]-1] += tmp;
    }
    for (auto x : ret) { printf("%.11f\n", x); }
    return 0;
}