package no298;

import java.util.ArrayList;
import java.util.Scanner;


public class Main {

	public static void main(String[] args) {
		new Main().solve();
	}

	int n;
	int m;
	ArrayList<Edge>[] g;
	@SuppressWarnings("unchecked")
	public void solve() {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		m = sc.nextInt();
		g = new ArrayList[n];
		for(int i=0;i<n;i++) {
			g[i] = new ArrayList<>();
		}
		for(int i=0;i<m;i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			double c = sc.nextInt() / 100D;
			g[b].add(new Edge(a,c));
		}
		double ans = 0;
		for(int i=(1<<n-1)+1;i<1<<n;i+=2) {
			double p = 1;
			for(int v=1;v<n;v++) {
				double q = 1;
				for(Edge e:g[v]) {
					int u = e.to;
					if ((i >> u & 1) == 1) {
						q *= (1 - e.p);
					}
				}
				p *= (i >> v & 1) == 0 ? q : (1 - q);
			}
			ans += p;
		}
		System.out.println(ans);
	}

	static class Edge {
		int to;
		double p;
		public Edge(int to,double p) {
			this.to = to;
			this.p = p;
		}
		public String toString() {
			return "[" + to + "," + p + "]";
		}
	}
}