#include <bits/stdc++.h>
#define nmax 1502
#define rem 104659
using namespace std;

const int inf=1e18;
const long double dif=1e-10;

ifstream fin ("dmin.in");
ofstream fout ("dmin.out");

priority_queue< pair<long double,int>, vector< pair<long double,int> >, greater< pair<long double,int> > > Q;
vector< pair<int,long double> > G[nmax];
int n,m;
long double d[nmax];
int r[nmax];

void dijkstra(int node){
    for(int i=1;i<=n;++i)d[i]=1e18;
    r[node]=1;
    d[node]=0;
    Q.push({0,node});
    while(!Q.empty()){
        int dist=Q.top().first;
        int node_st=Q.top().second;
        Q.pop();
        if(d[node_st]<dist)continue;
        for(auto edge: G[node_st]){
            if(d[edge.first]-(d[node_st]+edge.second)>dif){
                d[edge.first]=d[node_st]+edge.second;
                r[edge.first]=r[node_st];
                Q.push({d[edge.first],edge.first});
            }
            else if(abs(d[edge.first]-(d[node_st]+edge.second))<dif)
                r[edge.first]=(r[edge.first]+r[node_st])%rem;
        }
    }
}

int main()
{
    int a,b,c;
    fin>>n>>m;
    for(int i=1;i<=m;++i){
        fin>>a>>b>>c;
        G[a].push_back({b,log((double)c)});
        G[b].push_back({a,log((double)c)});
    }
    dijkstra(1);
    for(int i=2;i<=n;++i)
        fout<<r[i]<<' ';
    fout<<endl;
    return 0;
}