#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;


void TopologicalSort_dfs(vector<vector<int> > &G, vector<int> &res, int node, vector<bool> &visit){
	if(visit[node] == true) return;
	visit[node] = true;
	for(auto itr = G[node].rbegin(); itr != G[node].rend(); itr++){
		TopologicalSort_dfs(G, res, *itr, visit);
	}
	/*
	for(int i=0; i<G[node].size(); i++){
		TopologicalSort(G, res, G[node][i], visit);
	}
	*/
	res.push_back(node);
}

vector<int> TopologicalSort(vector<vector<int>> &G){
	int n = G.size();
	vector<int> ret;
	vector<bool> visit(n,false);
	for(int i=0; i<n; i++){
		if(visit[i]) continue;
		TopologicalSort_dfs(G, ret, i, visit);		
	}
	reverse(ret.begin(), ret.end());
	return ret;
}


int main(){
	int n,m;
	cin >> n >> m;

	vector<int> a(m),b(m),c(m);
	for(int i=0; i<m; i++){
		cin >> a[i] >> b[i] >> c[i];
	}


	vector<vector<int>> G(n);
	for(int i=0; i<m; i++){
		G[a[i]].push_back(b[i]);
	}

	auto topo = TopologicalSort(G);
	vector<int> topo_inv(n);
	for(int i=0; i<n; i++){
		topo_inv[topo[i]] = i;
	}

	vector<vector<pair<int,double>>> rev(n);
	for(int i=0; i<m; i++){
		rev[b[i]].push_back({a[i],c[i]/100.0});
	}

	vector<vector<double>> dp(n, vector<double>(1<<n, 0));
	dp[topo_inv[0]][1<<topo_inv[0]] = 1.0;
	
	for(int i=topo_inv[0]+1; i<n; i++){
		int pos = topo[i];
		for(int s=0; s<(1<<i); s++){
			double x = dp[i-1][s];
			double y = 1.0;
			for(auto z: rev[pos]){
				int k = topo_inv[z.first];
				if((s>>k)&1){
					y *= 1.0 - z.second;
				}
			}
			y = 1.0-y;

			dp[i][s|(1<<i)] += x*y;
			dp[i][s|(0<<i)] += x*(1-y);
		}
	}

	vector<double> p(n, 0);
	for(int i=0; i<(1<<n); i++){
		for(int j=0; j<n; j++){
			if((i>>j)&1){
				p[topo[j]] += dp[n-1][i];
			}
		}
	}

	printf("%.12f\n", p[n-1]);
	return 0;
}