#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
int N,M;
vector<pair<int,int> >G[1000];
int C[1000];
long double dp[2][1000];
void solve()
{
	cin >> N >> M;
	for(int i = 0;i < M;i++)
	{
		int u,v,c;
		cin >> u >> v >> c;
		G[u].push_back(make_pair(v,c));
		C[u] += c;
	}
	int cur = 0;
	for(int i = 0;i < N;i++) dp[cur][i] = 10.0;
	for(int t = 0;t < 100;t++)
	{
		int nxt = 1-cur;
		for(int i = 0;i < N;i++) dp[nxt][i] = 0.0;
		for(int i = 0;i < N;i++)for(auto [j,c]:G[i]) dp[nxt][j] += dp[cur][i]*c/C[i];
		swap(cur,nxt);
	}

	cout << fixed << setprecision(16);
	for(int i = 0;i < N;i++) cout << dp[cur][i] << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}