import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const Q = readInt;
      auto I = new int[Q];
      auto S = new int[Q];
      auto T = new int[Q];
      foreach (q; 0 .. Q) {
        I[q] = readInt - 1;
        S[q] = readInt;
        T[q] = readInt;
      }
      
      const maxT = T.maxElement;
      auto fs = new int[maxT + 1];
      foreach (q; 0 .. Q) {
        ++fs[S[q]];
        --fs[T[q]];
      }
      foreach (x; 0 .. maxT) {
        fs[x + 1] += fs[x];
      }
      auto gsSum = new real[maxT + 1];
      gsSum[0] = 0.0L;
      foreach (x; 0 .. maxT) {
        gsSum[x + 1] = gsSum[x] + (fs[x] ? (1.0L / fs[x]) : 0.0L);
      }
      
      auto ans = new real[N];
      ans[] = 0.0L;
      foreach (q; 0 .. Q) {
        ans[I[q]] += (gsSum[T[q]] - gsSum[S[q]]);
      }
      foreach (i; 0 .. N) {
        writefln("%.9f", ans[i]);
      }
      debug {
        writeln("========");
      }
    }
  } catch (EOFException e) {
  }
}