#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, m;
vector<P> gr[22];
int main()
{
    cin>>n>>m;
    for(int i=0; i<m; i++){
        int a, b, c; cin>>a>>b>>c;
        gr[b].push_back({a, c});
    }
    double ans=0;
    for(int i=(1<<(n-1)|1); i<(1<<n); i+=2){
        double p0=1;
        for(int j=1; j<n; j++){
            double p=1;
            for(auto q:gr[j]){
                if(i&(1<<q.first)) p*=(1.0-(double)q.second/100);
            }
            if(i&(1<<j)) p0*=(1-p);
            else p0*=p;
        }
        ans+=p0;
    }
    printf("%.7lf\n", ans);
    return 0;
}