#include using namespace std; //#pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={1,0,-1,0,1,1,-1,-1,0}; const ll dx[9]={0,1,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ CST(10); ll n,q;cin >> n >> q; ll M=100010; vl cum(M); vvpl g(n); rep(i,q){ ll a,b,c;cin >> a >>b >>c;a--; cum[b]++;cum[c]--; g[a].emplace_back(b,c); } rep(i,M-1)cum[i+1]+=cum[i]; vector dp(M); rep(i,M-1){ if(cum[i]==0)continue; dp[i+1]=1.0/cum[i]; } rep(i,M-1)dp[i+1]+=dp[i]; //rep(i,10)cout << dp[i] <<" ";cout << endl; rep(i,n){ double ans=0; for(auto [b,c]:g[i]){ ans+=dp[c]-dp[b]; } cout << ans << endl; } }