#include #include using namespace atcoder; using namespace std; using ll=long long; using ld=long double; ld pie=3.141592653589793; ll mod=1000000007; ll inf=10090000000000000; int main(){ ll n,q; cin >> n >> q; vectorx(q),s(q),t(q); priority_queue,vector>,greater>>pq; for (ll i = 0; i < q; i++) { cin >> x[i] >> s[i]>> t[i]; x[i]--; pq.push({s[i],1}); pq.push({t[i],-1}); } ld y=0; vectormemo(100001,-1); while (!pq.empty()) { pairp=pq.top(); pq.pop(); y+=p.second; if (y==0) { memo[p.first]=0; continue; } memo[p.first]=1.0/y; } for (ll i = 1; i < memo.size(); i++) { if (memo[i]==-1) { memo[i]=memo[i-1]; } } vectorwa(memo.size(),0); wa[0]=memo[0]; for (ll i = 1; i < wa.size(); i++) { wa[i]=wa[i-1]+memo[i]; } vectorans(n,0); for (ll i = 0; i < q; i++) { if (s[i]==0) { ans[x[i]]+=wa[t[i]-1]; }else{ ans[x[i]]+=wa[t[i]-1]-wa[s[i]-1]; } } for (ll i = 0; i < n; i++) { cout << setprecision(100) << ans[i] << endl; } }