#include <bits/stdc++.h>
using namespace std;
ifstream f("dmin.in");
ofstream g("dmin.out");
const long long INF = LLONG_MAX, MOD = 104659;
bitset<1500> viz;
int main()
{
    ios_base::sync_with_stdio(false);
    f.tie(nullptr);

    int n, m;
    f >> n >> m;
    vector<vector<pair<int,long long>>> v(n+1, vector<pair<int,long long>>());
    vector<long long> d(n+1, INF);
    vector<int> cnt(n+1,0);
    cnt[1]=1;
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
    for(int i=1; i<=m; i++)
    {
        int x, y, c;
        f >> x >> y >> c;
        v[x].push_back({y,c});
        v[y].push_back({x,c});
    }
    pq.push({1,1});
    d[1]=1;
    while(!pq.empty())
    {
        int dist, nod;
        tie(dist,nod) = pq.top();
        pq.pop();

            for(auto vc : v[nod])
            {
                if(d[vc.first]>d[nod]*vc.second)
                {
                    d[vc.first]=d[nod]*vc.second;
                    pq.push({d[vc.first],vc.first});
                    cnt[vc.first]=1;
                }else if(d[vc.first]==d[nod]*vc.second)
                {
                    cnt[vc.first]=(cnt[vc.first]+1)%MOD;
                    pq.push({d[vc.first],vc.first});
                }
            }
    }
    for(int i=2; i<=n; i++)
        g << cnt[i]%MOD << " ";

}