#include int main () { int n = 0; int q = 0; int ist[100000][3] = {}; int res = 0; double ans[100000] = {}; int cnt[100001] = {}; double sum[100001] = {}; res = scanf("%d", &n); res = scanf("%d", &q); for (int i = 0; i < q; i++) { res = scanf("%d", ist[i]); res = scanf("%d", ist[i]+1); res = scanf("%d", ist[i]+2); ist[i][0]--; cnt[ist[i][1]]++; cnt[ist[i][2]]--; } for (int i = 0; i < 100000; i++) { if (cnt[i] > 0) { sum[i+1] = sum[i]+1.0/((double)cnt[i]); } cnt[i+1] += cnt[i]; } for (int i = 0; i < q; i++) { ans[ist[i][0]] += sum[ist[i][2]]-sum[ist[i][1]]; } for (int i = 0; i < n; i++) { printf("%.16lf\n", ans[i]); } return 0; }