#include <stdio.h>

typedef struct {
	int key, id;
} data;

typedef struct {
	data obj[100001];
	int size;
} min_heap;

void push(min_heap* h, data x)
{
	int i = ++(h->size), j = i >> 1;
	data tmp;
	h->obj[i] = x;
	while (j > 0) {
		if (h->obj[i].key < h->obj[j].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j >>= 1;
		} else break;
	}
}

data pop(min_heap* h)
{
	int i = 1, j = 2;
	data output = h->obj[1], tmp;
	h->obj[1] = h->obj[(h->size)--];
	while (j <= h->size) {
		if (j < h->size && h->obj[j^1].key < h->obj[j].key) j ^= 1;
		if (h->obj[j].key < h->obj[i].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j <<= 1;
		} else break;
	}
	return output;
}

int main()
{
	int i, N, Q, I[100001], S[100001], T[100001];
	scanf("%d %d", &N, &Q);
	for (i = 1; i <= Q; i++) scanf("%d %d %d", &(I[i]), &(S[i]), &(T[i]));
	
	int num[100003] = {}, tmp;
	double sum[100003];
	for (i = 1; i <= Q; i++) {
		num[S[i]+1]++;
		num[T[i]+1]--;
	}
	for (i = 1, tmp = 0, sum[0] = 0.0; i <= 100000; i++) {
		tmp += num[i];
		num[i] = tmp;
		sum[i] = sum[i-1] + ((num[i] > 0)? 1.0 / num[i]: 0.0);
	}
	
	int beg[100001] = {};
	double ans[100001] = {};
	min_heap h[2];
	data d;
	h[0].size = 0;
	h[1].size = 0;
	for (i = 1; i <= Q; i++) {
		d.key = S[i];
		d.id = i;
		push(&(h[0]), d);
	}
	for (i = 0; i <= 100000; i++) {
		while (h[0].size > 0 && h[0].obj[1].key == i) {
			d = pop(&(h[0]));
			beg[I[d.id]] = i;
			d.key = T[d.id];
			push(&(h[1]), d);
		}
		while (h[1].size > 0 && h[1].obj[1].key == i) {
			d = pop(&(h[1]));
			ans[I[d.id]] += sum[i] - sum[beg[I[d.id]]];
		}
	}
	for (i = 1; i <= N; i++) printf("%.6f\n", ans[i]);
	fflush(stdout);
	return 0;
}