#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;
};

int main() {
	int N; int M;
	while(~scanf("%d%d", &N, &M)) {
		vector<S> rels(M);
		rep(i, M) {
			int A; int B; int C;
			scanf("%d%d%d", &A, &B, &C);
			S s{A, B, C / 100.};
			rels[i] = s;
		}
		if(M > 24) return 1;
		double ans = 0;
		rep(i, 1 << M) {
			double prob = 1;
			rep(j, M) {
				const S &s = rels[j];
				prob *= (i >> j & 1) ? s.C : 1 - s.C;
			}
			int reach = 1 << 0;
			rep(k, M) {
				int p = reach;
				rep(j, M) if(i >> j & 1) {
					const S &s = rels[j];
					if(reach >> s.A & 1)
						reach |= 1 << s.B;
				}
				if(reach == p || (reach >> (N - 1) & 1))
					break;
			}
			if(reach >> (N - 1) & 1)
				ans += prob;
		}
		printf("%.10f\n", ans);
	}
	return 0;
}