#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
const ll mod = 1e9 + 7;

typedef pair<double, int> PDI;
const int N = 30;

vector<PDI> edges[N];
double dp[N];

double rec(int v) {
  if (dp[v] >= 0) {
    return dp[v];
  }
  if (v == 0) {
    return 1;
  }
  double prod = 1.0;
  for (auto &w: edges[v]) {
    prod *= 1 - rec(w.second) * w.first;
  }
  return dp[v] = 1 - prod;
}

int main(void){
  int n, m;
  cin >> n >> m;
  REP(i, 0, m) {
    int a, b;
    double c;
    cin >> a >> b >> c;
    c /= 100;
    edges[b].push_back(PDI(c, a));
  }
  REP(i, 0, n) {
    dp[i] = -1;
  }
  printf("%.15f\n", rec(n - 1));
}