#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

struct S {
	int A, B;
	double C;
};

bool topologicalSort(const vector<vi> &g, vi &ord) {
	int n = g.size();
	vi deg(n);
	rep(i, n) each(j, g[i]) deg[*j] ++;
	ord.assign(n, -1);
	int t = 0;
	rep(i, n) if(deg[i] == 0) ord[t ++] = i;
	for(int h = 0; h < t; h ++) {
		int v = ord[h];
		each(j, g[v])
			if(-- deg[*j] == 0)
				ord[t ++] = *j;
	}
	return t == n;
}

int main() {
	int N; int M;
	while(~scanf("%d%d", &N, &M)) {
		vector<S> rels(M);
		vector<vector<S> > ig(N);
		vector<vi> g(N);
		rep(i, M) {
			int A; int B; int C;
			scanf("%d%d%d", &A, &B, &C);
			if(A < 0 || A >= N || B < 0 || B >= N) return 0;
			S s{A, B, C / 100.};
			rels[i] = s;
			ig[B].push_back(s);
			g[A].push_back(B);
		}
		//？？？？
		vector<int> deg(N);
		rep(i, N)
			deg[i] = ig[i].size();
		vector<bool> vis(N);
		vector<double> dp(N);
		reu(ix, 0, N) {
			int i = -1;
			rep(j, N) if(deg[j] == 0 && !vis[j]) {
				i = j;
				break;
			}
			if(i == -1) break;
			vis[i] = true;
			each(j, g[i])
				-- deg[*j];
			if(i == 0) {
				dp[i] = 1;
				continue;
			}
			int vs = 0;
			for(S s : ig[i])
				vs |= 1 << s.A;
			for(int j = vs; j > 0; (-- j) &= vs) {
				double p = 1;
				for(S s : ig[i])
					p *= j >> s.A & 1 ? dp[s.A] * s.C : (1 - dp[s.A]) + dp[s.A] * (1 - s.C);
				dp[i] += p;
			}
		}
		double ans = dp[N - 1];
		printf("%.10f\n", ans);
		break;
	}
	return 0;
}