#include <fstream>
#include <vector>
#include <queue>

#define MOD 104659

using namespace std;

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

const long long int INF = 1e9;

int n,m,x,y,c;
vector<long long> metode;

void dijkstra(int startNode, const vector<vector<pair<int,int>>>& adj, vector<long long>& dist){
    priority_queue<pair<long long int,int>, vector<pair<long long int, int>>, greater<pair<long long int,int>>> pq;

    pq.push({0,startNode});
    dist[startNode] = 0;

    while(!pq.empty()){
        auto [wt, node] = pq.top();
        pq.pop();

        if(wt > dist[node])
            continue;

        for(auto& [neigh, cost]: adj[node]){
            if(dist[neigh] > cost + dist[node]){
                dist[neigh] = cost + dist[node];
                metode[neigh] = metode[node];
                pq.push({dist[neigh], neigh});
            }
            else if(dist[neigh] == cost + dist[node]){
                metode[neigh] = (metode[neigh] + metode[node]) % MOD;
            }
        }
    }

    for(int i=2; i<=n; i++){
        g << metode[i] << " " ;
    }
}

int main(){
    
    f >> n >> m;
    vector<vector<pair<int,int>>> adj(n+1);
    vector<long long> dist(n+1, INF);
    metode.resize(n+1, 0);

    for(int i=1; i<=m; i++){
        f >> x >> y >> c;
        adj[x].push_back(make_pair(y,c));
        adj[y].push_back(make_pair(x,c));
    }

    metode[1] = 1;
    dijkstra(1,adj,dist);


    return 0;
}