#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("dmin.in");
ofstream cout("dmin.out");
const double INF = 1e18;
const double EPS = 1e-6;
const int MOD = 104659;
int n, m, x, y, z;
vector<vector<pair<int, int>>> graf;
vector<double> d;
vector<int> viz, ans;
void djikstra()
{
    priority_queue<pair<double, int>, vector<pair<double, int>>, greater<pair<double, int>>> q;
    q.push({0.0, 1});
    while(!q.empty())
    {
        int node = q.top().second;
        q.pop();
        if(!viz[node])
        {
            for(auto &[next, cost]:graf[node])
                if(d[next] - d[node] - cost > EPS)
                {
                    d[next] = d[node] + cost;
                    ans[next] = ans[node];
                    q.push({d[next], next});
                }
                else
                    if(fabs(d[node] + next - d[next] < EPS))
                        ans[next] = (ans[next] + ans[node]) % MOD;
            viz[node] = 1;
        }
    }
}
int main()
{
    cin >> n >> m;
    graf.assign(n+1, vector<pair<int, int>>());
    viz.resize(n+1);
    d.assign(n+1, INF);
    ans.resize(n+1);
    for(int i=1; i<=m; i++)
    {
        cin >> x >> y >> z;
        z = log2(z);
        graf[x].push_back({y, z});
        graf[y].push_back({x, z});
    }
    d[1] = 0.0;
    ans[1] = 1;
    djikstra();
    for(int i=2; i<=n; i++)
        cout << ans[i] << " ";
    return 0;
}