def main():
    import sys
    from collections import deque

    N, M = map(int, sys.stdin.readline().split())
    edges = [[] for _ in range(N)]
    in_degree = [0] * N
    adj = [[] for _ in range(N)]

    for _ in range(M):
        A, B, C = map(int, sys.stdin.readline().split())
        edges[B].append((A, C))
        adj[A].append(B)
        in_degree[B] += 1

    # Topological sort
    queue = deque()
    for i in range(N):
        if in_degree[i] == 0:
            queue.append(i)

    topological_order = []
    while queue:
        u = queue.popleft()
        topological_order.append(u)
        for v in adj[u]:
            in_degree[v] -= 1
            if in_degree[v] == 0:
                queue.append(v)

    # Calculate probabilities
    prob = [0.0] * N
    prob[0] = 1.0

    for b in topological_order:
        if b == 0:
            continue
        product = 1.0
        for (a, c) in edges[b]:
            p = prob[a] * (c / 100.0)
            product *= (1.0 - p)
        prob[b] = 1.0 - product

    print("{0:.10f}".format(prob[N-1]))

if __name__ == "__main__":
    main()