#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
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; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N, Q;
	cin >> N >> Q;
	vi I(Q), S(Q), T(Q);
	rep(i, Q) cin >> I[i] >> S[i] >> T[i];

	lint a=0, b=0, c=0, x, y, z;
	vi v(100100);
	rep(i, Q) {
		v[S[i]]++;
		v[T[i]]--;
	}
	rep(i, 100100-1) v[i+1] += v[i];
	std::vector<double> d(100100), e(N);
	rep(i, 100100-1) {
		if (!v[i]) d[i+1] = 0;
		else d[i+1] = (double)1/v[i];
	}
	rep(i, 100100-2) d[i+1] += d[i];
	rep(i, Q) {
		e[I[i]-1] += d[T[i]]-d[S[i]];
	}
	rep(i, N) cout << fixed << setprecision(10) << e[i] << endl;

}