#include <bits/stdc++.h>
#include <iterator>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define debug 1
using ll = long long;
using ld = long double;
const int mod = 998244353;
const double pi = atan2(0, -1);
#include <time.h>
#include <chrono>

int main() {
	int N, Q;
	cin >> N >> Q;
	vector<double> ans(N + 1, 0);
	set<int> list;
	map<int, vector<int>> mp;
	unordered_set<int> play;
	vector<vector<vector<int>>> ord(N + 1);
	int sum = 0;
	int now = 0;
	vector<double> tl(100002);
	rep(i, Q) {
		int p, s, t;
		cin >> p >> s >> t;
		s++;
		t++;
		list.insert(s);
		list.insert(t);
		mp[s].push_back(p);
		mp[t].push_back(p);
		ord[p].push_back({ s,t });
	}
	for(int time = 1; time < 100002;time++) {
		if (list.count(time)) {
			for (int x : mp[time]) {
				if (play.count(x)) {
					play.erase(x);
					sum--;
				}
				else {
					play.insert(x);
					sum++;
				}
			}
		}
		if (sum >= 1) {
			tl[time] = (double)1 / (double)sum;
		}
		tl[time] += tl[time - 1];
	}
	for (int i = 1; i <= N; i++) {
		for (vector<int> v : ord[i]) {
			ans[i] += tl[v[1]-1] - tl[v[0] - 1];
		}
		cout << fixed << setprecision(10);
		cout << ans[i] << endl;
	}
}