#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/lazysegtree>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}


template<typename T, int N, int M>
class Matrix {
    public:
    array<array<T, M>, N> dat;
    Matrix(T val) {
        for(int i = 0; i < N; i++){
            for(int j = 0; j < M; j++){
                dat[i][j] = val;
            }
        }
    }

    Matrix(array<array<T, M>, N> dat): dat(dat){  }
    array<T, M>& operator[](int x) {
        return dat[x];
	}
};

template<typename T, int N, int M, int K>
Matrix<T, N, K> operator*(Matrix<T, N, M> a, Matrix<T, M, K> b){
    Matrix<T, N, K> c(T(0));
    for(int i = 0; i < N; i++){
        for(int j = 0; j < K; j++){
            for(int k = 0; k < M; k++){
                c.dat[i][j] += a.dat[i][k]*b.dat[k][j];
            }
        }
    }
    return c;
}

template<typename T, int N, int M>
Matrix<T, N, M> operator+(Matrix<T, N, M> a, Matrix<T, N, M> b){
    Matrix<T, N, M> c(T(0));
    for(int i = 0; i < N; i++){
        for(int j = 0; j < M; j++){
            c.dat[i][j] += a.dat[i][j]+b.dat[i][j];
        }
    }
    return c;
}


using Mat = Matrix<double, 2, 2>;
using Vec = Matrix<double, 2, 1>;

const int T = 100005;

Vec op(Vec x, Vec y){
    return x+y;
}

Vec e(){
    return Vec(0);
}

Vec mapping(Mat f, Vec x){
    return f*x;
}

Mat composition(Mat f, Mat g){
    return f*g;
}

Mat make_id(){
    Mat ans(0);
    ans[0][0] = 1;
    ans[1][1] = 1;
    return ans;
}

Mat _id = make_id();

Mat id(){
    return _id;
}

using Seg = atcoder::lazy_segtree<Vec, op, e, Mat, mapping, composition, id>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, q; cin >> n >> q;
    vector<vector<int>> starts(T);
    vector<vector<int>> ends(T);
    for(int i = 0; i < q; i++){
        int j, s, t; cin >> j >> s >> t; j--;
        starts[s].push_back(j);
        ends[t].push_back(j);
    }
    int sum = 0;
    Seg seg(n);
    for(int t = 0; t < T; t++){
        for(int i: starts[t]){
            auto v = seg.get(i);
            v[1][0] = 1;
            seg.set(i, v);
            sum++;
        }
        for(int i: ends[t]){
            auto v = seg.get(i);
            v[1][0] = 0;
            seg.set(i, v);
            sum--;
        }
        if(sum != 0){
            double x = 1.0/(double)sum;
            Mat m = id();
            m[0][1] = x;
            seg.apply(0, n, m);
        }
        
    }
    for(int i = 0; i < n; i++){
        cout << seg.get(i)[0][0] << endl;
    }
}