#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef complex<double> C;

const int MAXN = 25;
double dp[MAXN];

struct edge {
    int to;
    double trans;
    edge() {}
    edge(int to, double trans) : to(to), trans(trans) {}
};

vector<edge> rG[MAXN];

double dfs(int now) {
    if (now == 0) return 0;
    double& ret = dp[now];
    if (ret >= 0) return ret;
    ret = 0;
    int n = rG[now].size();
    vector<double> P(n);
    for (int i = 0; i < (int)rG[now].size(); i++) {
        P[i] = dfs(rG[now][i].to);
    }
    for (int s = 0; s < (1<<n); s++) {
        double tmp = 1;
        for (int i = 0; i < n; i++) {
            if ((s>>i)&1) {
                tmp *= P[i];
            } else {
                tmp *= (1-P[i]) * (1-rG[now][i].trans);
            }
        }
        ret += tmp;
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    assert(1 <= n && n <= 20);
    assert(0 <= m && m <= n*(n-1)/2);
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        double p = c/100.;
        rG[b].emplace_back(a, p);
    }
    for (int i = 0; i < MAXN; i++) dp[i] = -1;
    printf("%.15lf\n", 1-dfs(n-1));
    return 0;
}