#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 21;

struct edge
{
    int to,cost;
};

vector<edge> G[MAX_N];

int main()
{
    int n,m;
    cin >> n >> m;
    rep(i,m){
        int a,b,c;
        cin >> a >> b >> c;
        G[b].pb((edge){a,c});
    }
    double ans = 0;
    rep(i,1 << (n-2)){
        int bf = i;
        bf <<= 1;
        bf += (1 << (n-1));
        bf += 1;
        double res = 1;
        for(int j=1;j<n;j++){
            if((bf >> j) & 1){
                double tm = 1;
                rep(k,G[j].size()){
                    if((bf >> G[j][k].to) & 1){
                        tm *= (100 - G[j][k].cost) * 0.01;
                    }
                }
                res *= (1-tm);
            }else{
                double tm = 1;
                rep(k,G[j].size()){
                    if(bf & (1 << G[j][k].to)){
                        tm *= (100 - G[j][k].cost) * 0.01;
                    }
                }
                res *= tm;
            }
        }
        ans += res;
    }
    printf("%.10f\n",ans);
    return 0;
}