#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N, M = map(int, readline().split())
m = map(int, read().split())
ABC = tuple(zip(m,m,m))
graph = [[] for _ in range(N)]
in_deg = [0] * N
for a, b, c in ABC:
    graph[a].append(b)
    in_deg[b] += 1

order = []
for _ in range(N):
    i = in_deg.index(min(in_deg))
    in_deg[i] = 1000
    order.append(i)
    for j in graph[i]:
        in_deg[j] -= 1

goal = order.index(N - 1)
mat = [0] * (N * N)
for a, b, c in ABC:
    i = order.index(a)
    j = order.index(b)
    mat[N * i + j] = c / 100

dp = [0.0] * (1 << N)
dp[1] = 1.0
for i in range(1, N):
    for n in range(1 << i):
        m = n + (1 << i)
        p = 1  # not talk
        for j in range(i):
            if (n >> j) & 1:
                p *= (1 - mat[N * j + i])
        dp[m] = (1 - p) * dp[n]
        dp[n] *= p

answer = 0
for n in range(1 << N):
    if n & (1 << goal):
        answer += dp[n]
print(answer)