#include <fstream>
#include <vector>
#include <queue>
#define nmax 1501
#define mod 104659
#define inf (long long)(1e18)
using namespace std;
ifstream cin("dmin.in");
ofstream cout("dmin.out");
int n,m,nr[nmax],x,y;
long long dp[nmax],c;
bool viz[nmax];
struct muchie{
    int x;
    long long c;
};
vector<muchie>v[nmax];
struct cmp{
    bool operator()(const muchie& a,const muchie& b){
        return a.c>b.c;
    }
};
priority_queue<muchie,vector<muchie>,cmp>q;
void dijkstra(){
    for(int i=2;i<=n;i++)
        dp[i]=inf;
    q.push({1,0});
    nr[1]=1;
    while(!q.empty()){
        int nod=q.top().x;
        q.pop();
        if(viz[nod])
            continue;
        viz[nod]=1;
        for(auto i:v[nod])
            if(dp[i.x]==dp[nod]+i.c)
                nr[i.x]=(nr[i.x]+nr[nod])%mod;
            else if(dp[i.x]>dp[nod]+i.c){
                dp[i.x]=dp[nod]+i.c;
                nr[i.x]=nr[nod];
                q.push({i.x,dp[i.x]});
            }
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>c;
        v[x].push_back({y,c});
        v[y].push_back({x,c});
    }
    dijkstra();
    for(int i=2;i<=n;i++)
        cout<<nr[i]<<" ";
    return 0;
}