#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, q; cin >> n >> q; vectorh(q), s(q), t(q); int mx = 100000; vectorimos(mx + 1); rep(i, q) { cin >> h[i] >> s[i] >> t[i]; h[i]--; imos[s[i]]++; imos[t[i]]--; } rep(i, mx)imos[i + 1] += imos[i]; vectorval(mx), sval(mx + 1); rep(i, mx)if (0 != imos[i])val[i] = 1. / imos[i]; rep(i, mx)sval[i + 1] = sval[i] + val[i]; vectorans(n); rep(i, q) ans[h[i]] += sval[t[i]] - sval[s[i]]; rep(i, n) cout << setprecision(16) << ans[i] << endl; return 0; }