#include<fstream>
#include<vector>
#include<queue>
#define mod 104659
using namespace std;

int i,j,n,m;
unsigned long x,y,cost1,d[1501],nr[1501];
struct muchie
{
    int nod,cost;
};
vector<muchie> a[1501];
void dijkstra(int x)
{
    int i;
    queue<int> q;
    q.push(x);
    d[x]=0;
    nr[x]=1;
    while(!q.empty())
    {
        x=q.front();
        for(i=0;i<a[x].size();++i)
        {
        if(d[a[x][i].nod]>d[x]+a[x][i].cost)
        {
            d[a[x][i].nod]=d[x]+a[x][i].cost;
            nr[a[x][i].nod]=nr[x]%mod;
            q.push(a[x][i].nod);
        }
        else
        if(d[a[x][i].nod]==d[x]+a[x][i].cost)
            nr[a[x][i].nod]=(nr[a[x][i].nod]+nr[x])%mod;
        }
        q.pop();
    }
}
int main()
{
    ifstream f("dmin.in");
    ofstream g("dmin.out");
    f>>n>>m;
    for(i=1;i<=m;++i)
    {
        f>>x>>y>>cost1;
        a[x].push_back((muchie) {y,cost1});
        a[y].push_back((muchie) {x,cost1});
    }
    for(i=1;i<=n;++i)
    d[i]=1<<20,nr[i]=0;
    dijkstra(1);
	for(i=2;i<=n;++i)
		g<<nr[i]%mod<<" ";
    return 0;
}