#include <bits/stdc++.h>
#define INF 0x3f3f3f3f3f3f3f3fLL
#define MOD 104659
 
using namespace std;
using PA = pair<int, int>;
 
ifstream fin("dmin.in");
ofstream fout("dmin.out");
 
int n, m, x, y, z, drumuri[1505];
long long d[1505];
vector<PA> G[1505];
priority_queue<PA, vector<PA>, greater<PA> > Q;
 
void dijkstra(int s) {
    fill(d, d + n + 1, INF);
    Q.push({0, s});
    d[s] = 0;
    drumuri[s] = 1;
    while(!Q.empty()) {
        long long x = Q.top().first;
        y = Q.top().second;
        Q.pop();
        if(x > d[y]) {
            continue;
        }
        for(auto i : G[y]) {
            int vecin = i.first;
            long long cost = 1LL * i.second;
            if(d[y] + cost < d[vecin]) {
                d[vecin] = d[y] + cost;
                Q.push({d[vecin], vecin});
                drumuri[vecin] = drumuri[y];
            } else if(d[y] + cost == d[vecin]) {
                drumuri[vecin] = (drumuri[vecin] + 1LL * drumuri[y]) % MOD;
            }
        }
    }
}
 
int main() {
    fin >> n >> m;
    for(int i = 1; i <= m; i++) {
    	fin >> x >> y >> z;
        G[x].push_back({y, z});
        G[y].push_back({x, z});
    }
    fin.close();
    dijkstra(1);
    for(int i = 2; i <= n; i++) {
        fout << drumuri[i] << " ";
    }
    fout.close();
	return 0;
}