#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#define INF 0x3F3F3F3F
#define MOD 104659
#define EPSILON 0.001
using namespace std;

ifstream f("dmin.in");
ofstream g("dmin.out");


vector<pair<int, double> > graf[1505];
int n, m;
bool inQ[1505];
double d[1505];
int nrD[1505];
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > Q;

void read()
{
    f>>n>>m;
    int x, y;
    double c;
    for(int i = 0; i<m; i++)
    {
        f>>x>>y>>c;
        graf[x].push_back({y, log(c)});
        graf[y].push_back({x, log(c)});
    }
}

void init()
{
    for(int i = 2; i<=n; i++)
    {
        d[i] = INF;
    }
    d[1] = log(1);
    nrD[1] = 1;
}

void dijkstra()
{
    Q.push({d[1], 1});
    inQ[1] = true;
    while(!Q.empty())
    {
        int node = Q.top().second;
        inQ[node] = true;
        Q.pop();
        for(auto &p : graf[node])
        {
            if(d[node] + p.second - d[p.first] < -EPSILON)
            {
                d[p.first] = d[node] + p.second;
                nrD[p.first] = nrD[node];
                if(!inQ[p.first])
                {
                    Q.push({d[p.first], p.first});
                    inQ[p.first] = true;
                }
            }
            else if(abs(d[node] + p.second - d[p.first]) < EPSILON)
            {
                nrD[p.first] = (nrD[p.first] + nrD[node])%MOD;
            }
        }
    }
}

int main()
{
    read();
    init();
    dijkstra();
    for(int i = 2; i<=n; i++)
    {
        if(d[i] != INF)
            g<<nrD[i]<<" ";
        else
            g<<"0 ";
    }
    return 0;
}