def read_data():
    N, M = map(int, input().split())
    Cs = [[] for i in range(N)]
    for m in range(M):
        src, dst, c = map(int, input().split())
        Cs[dst].append((src, c/100))
    return N, M, Cs

def solve(N, M, Cs):
    vs = [v for v in range(1, N)]
    vs.sort(key=lambda v: len(Cs[v]))
    prob = 0
    for on_off in range(1 + (1 << (N - 1)), 1 << N, 2):
        prob += calc_prob(on_off, vs, Cs)
    return prob

def calc_prob(on_off, vs, Cs):
    prob = 1
    for v in vs:
        if prob == 0:
            return 0
        p_off = 1
        for u, c in Cs[v]:
            if not on_off & (1 << u):
                continue
            p_off *= (1 - c)
        if on_off & (1 << v):
            prob *= (1 - p_off)
        else:
            prob *= p_off
    return prob

N, M, Cs = read_data()
print(solve(N, M, Cs))