#include <bits/stdc++.h>
#define X first
#define Y second
#define INF 1000000001
#define MOD 104659
using namespace std;
ifstream fin("dmin.in");
ofstream fout("dmin.out");
int n,m,i,x,y,nod,Drum[1501];
double D[1501];
double z;
vector<pair<int,double> > L[2510];
set<pair<double,int> > s;
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>z;
        L[x].push_back(make_pair(y,log(z)));
        L[y].push_back(make_pair(x,log(z)));
    }
    for(i=2;i<=n;i++)
        D[i]=INF;
    D[1]=0;
    Drum[1]=1;
    s.insert(make_pair(0,1));
    while(!s.empty()){
        nod=s.begin()->Y;
        s.erase(s.begin());
        for(i=0;i<L[nod].size();i++){
            int vec=L[nod][i].X;
            double cost=L[nod][i].Y;
            if(D[vec]==D[nod]+cost)
                Drum[vec]=(Drum[nod]+Drum[vec])%MOD;
            if(D[vec]>D[nod]+cost){
                s.erase(make_pair(D[vec],vec));
                D[vec]=D[nod]+cost;
                Drum[vec]=Drum[nod];
                s.insert(make_pair(D[vec],vec));
            }
        }
    }
    for(i=2;i<=n;i++)
        fout<<Drum[i]<<" ";
    return 0;
}