#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
int main(){
  ll n,m;cin >> n >>m;
  vvpl g(n);
  rep(i,m){
    ll a,b,c;cin >> a >> b >> c;
    g[b].pb({a,c});
  }
  using ld=long double;
  ld ans=0;
  rep(bit,1<<(n-1)){
    if(!(bit&1))continue;
    ld ret=1;
    rep(i,n){
      if(!i)continue;
      ld now=1;
      for(auto p:g[i]){
        if(bit&(1<<p.fi)){
          now*=(100.0-p.se)/100;
        }
      }
      if(bit&(1<<i))ret*=1.0-now;
      else ret*=now;
    }
    ans+=ret;
  }
  CST(10);
  cout << 1.0-ans <<endl;
}