import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, 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; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


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

int[][] G, H;

bool[] vis;
int[] us;

void dfs(int u) {
  vis[u] = true;
  foreach (i; G[u]) {
    const v = B[i];
    if (!vis[v]) {
      dfs(v);
    }
  }
  us ~= u;
}

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] = readInt() / 100.0;
      }
      
      G = new int[][N];
      H = new int[][N];
      foreach (i; 0 .. M) {
        G[A[i]] ~= i;
        H[B[i]] ~= i;
      }
      
      vis = new bool[N];
      us = [];
      foreach (u; 0 .. N) {
        if (!vis[u]) {
          dfs(u);
        }
      }
      us.reverse;
      auto ord = new int[N];
      foreach (j; 0 .. N) {
        ord[us[j]] = j;
      }
      debug {
        writeln("us = ", us);
        writeln("ord = ", ord);
      }
      assert(ord[0] < ord[N - 1]);
      
      auto dp = new real[1 << N];
      dp[0] = 1.0;
      foreach (j; 0 .. N) {
        foreach (s; 0 .. 1 << j) {
          real p = 1.0;
          foreach (i; H[us[j]]) {
            const k = ord[A[i]];
            if ((s >> k) & 1) {
              p *= (1.0 - C[i]);
            }
          }
          if (us[j] == 0) {
            p = 0.0;
          }
          dp[s | 1 << j] = dp[s] * (1.0 - p);
          dp[s] *= p;
        }
        debug {
          writeln(dp);
        }
      }
      real ans = 0.0;
      foreach (s; 0 .. 1 << N) {
        if ((s >> ord[N - 1]) & 1) {
          ans += dp[s];
        }
      }
      writefln("%.10f", ans);
    }
  } catch (EOFException e) {
  }
}