import sys
from collections import deque

def main():
    N, M = map(int, sys.stdin.readline().split())
    edges = []
    adj = [[] for _ in range(N)]
    graph = [[] for _ in range(N)]  # For each B, list of (A, C)
    for _ in range(M):
        A, B, C = map(int, sys.stdin.readline().split())
        edges.append((A, B, C))
        adj[A].append(B)
        graph[B].append((A, C))
    
    # Compute in_degree
    in_degree = [0] * N
    for A, B, C in edges:
        in_degree[B] += 1
    
    # Kahn's algorithm for topological sort
    queue = deque()
    for i in range(N):
        if in_degree[i] == 0:
            queue.append(i)
    
    top_order = []
    while queue:
        u = queue.popleft()
        top_order.append(u)
        for v in adj[u]:
            in_degree[v] -= 1
            if in_degree[v] == 0:
                queue.append(v)
    
    # Compute probabilities
    x = [0.0] * N
    x[0] = 1.0  # Starting point
    
    for u in top_order:
        if u == 0:
            continue
        product = 1.0
        for (j, c) in graph[u]:
            product *= (1.0 - x[j] * c / 100.0)
        x[u] = 1.0 - product
    
    # Output the result for group N-1
    print("{0:.10f}".format(x[N-1]))

if __name__ == "__main__":
    main()