import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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; }
real readReal() { return readToken.to!real; }

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)); }


enum K = 100;
enum INIT = 10.0;

int N, M;
int[] A, B;
real[] C;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      A = new int[M];
      B = new int[M];
      C = new real[M];
      foreach (i; 0 .. M) {
        A[i] = readInt();
        B[i] = readInt();
        C[i] = readReal();
      }
      
      auto outSum = new real[N];
      outSum[] = 0.0;
      foreach (i; 0 .. M) {
        outSum[A[i]] += C[i];
      }
      auto dp = new real[][](K + 1, N);
      dp[0][] = INIT;
      foreach (k; 0 .. K) {
        dp[k + 1][] = 0.0;
        foreach (i; 0 .. M) {
          dp[k + 1][B[i]] += dp[k][A[i]] * (C[i] / outSum[A[i]]);
        }
      }
      foreach (u; 0 .. N) {
        writefln("%.10f", dp[K][u]);
      }
    }
  } catch (EOFException e) {
  }
}