#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define var auto
#define mod 1000000007
#define inf 2147483647
#define nil -1
typedef long long ll;

using namespace std;

inline int input(){
    int a;
    cin >> a;
    return a;
}

template <typename T>
inline void output(T a, int p) {
    if(p){
        cout << fixed << setprecision(p)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

// end of template

int main() {
    cin.tie(0);
    // source code
    int N = input();
    int M = input();
    
    vector<vector<int>> edge(N, vector<int> (N, 0));
    rep(i, M){
        int from, to, prob;
        cin >> from >> to >> prob;
        edge[from][to] = prob;
    }
    
    int pattern = 1 << (N - 2);
    bool isTalking[20];
    
    double ret = 0;
    
    rep(i, pattern){
        isTalking[0] = isTalking[N - 1] = true;
        repd(j, 1, N - 1){
            if ((i >> (j - 1)) & 1) {
                isTalking[j] = true;
            }
            else{
                isTalking[j] = false;
            }
        }
        
        double p = 1;
        repd(to, 1, N){
            double tmp = 1;
            rep(from, N){
                if (isTalking[from] && edge[from][to]) {
                    tmp *= 1 - edge[from][to] / 100.0;
                }
            }
            if (isTalking[to]) {
                p *= 1 - tmp;
            }
            else{
                p *= tmp;
            }
            
        }
        
        ret += p;
    }
    
    output(ret, 15);
    
    
    return 0;
}