//https://ncode.syosetu.com/n4830bu/298/
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> A(M), B(M);
    vector<double> C(M);
    for (int i = 0; i < M; i++) {
        cin >> A[i] >> B[i] >> C[i];
        C[i] /= 100;
    }
    vector<int> in(N);
    vector<vector<pair<int, double>>> G(N);
    for (int i = 0; i < M; i++) {
        G[A[i]].emplace_back(B[i], C[i]);
        in[B[i]]++;
    }
    queue<int> que;
    for (int i = 0; i < N; i++) {
        if (in[i] == 0)
            que.push(i);
    }
    vector<double> dp(1 << N);
    dp[1] = 1.0;
    while (!que.empty()) {
        auto a = que.front();
        que.pop();
        for (auto&& [b, c] : G[a]) {
            for (int bit = 0; bit < (1 << N); bit++) {
                if ((bit & (1 << a)) && (~bit & (1 << b))) {
                    dp[bit | (1 << b)] += dp[bit] * c;
                    dp[bit] *= (1 - c);
                }
            }
            in[b]--;
            if (in[b] == 0)
                que.push(b);
        }
    }
    double maine = 0;
    for (int bit = 0; bit < (1 << N); bit++) {
        if (bit & (1 << (N - 1)))
            maine += dp[bit];
    }
    cout << fixed << setprecision(7) << maine << endl;
}