#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstring>
#include <bitset>

#define Nmax 1605
#define MOD 104659
#define INF 0x3f3f3f3f

using namespace std;

vector<pair<int,int> > G[Nmax];
vector<int> daddy[Nmax];
queue<int> Q;
bitset<Nmax> inQ;

int N,M;
long long dist[Nmax];
int DP[Nmax];

void read()
{
    int a,b,c;
    scanf("%d%d",&N,&M);
    for(int i = 1; i <= M; ++i){
        scanf("%d%d%d",&a,&b,&c);
        G[a].push_back(make_pair(c,b));
        G[b].push_back(make_pair(c,a));
    }
}

void bellman_ford()
{
    Q.push(1);
    memset(dist,INF,sizeof(dist));
    dist[1] = 0;
    int k;
    while(!Q.empty())
    {
        k = Q.front();Q.pop();inQ[k] = 0;
        for(vector<pair<int,int> >::iterator it = G[k].begin(); it != G[k].end(); ++it)
            if(dist[it->second] >= dist[k] + it->first)
            {
                if(dist[it->second] > dist[k] + it->first)
                {
                    dist[it->second] = dist[k] + it->first;
                    daddy[it->second].clear();
                    daddy[it->second].push_back(k);
                    inQ[it->second] = 1;
                    Q.push(it->second);
                    continue;
                }
                daddy[it->second].push_back(k);
            }
    }
}

int dynamic(int k)
{
    if(DP[k])return DP[k];
    int sum = 0;
    for(vector<int>::iterator it = daddy[k].begin(); it != daddy[k].end(); ++it)
        sum = (sum%MOD + dynamic(*it)%MOD) % MOD;
    DP[k] = sum;
    return DP[k] % MOD;
}
void prepare()
{
    for(int i = 1; i <= N; ++i)
    {
        vector<int>::iterator it = unique(daddy[i].begin(),daddy[i].end());
        daddy[i].resize(distance(daddy[i].begin(),it));
    }
}


int main()
{
    freopen("dmin.in","r",stdin);
    freopen("dmin.out","w",stdout);

    read();
    bellman_ford();
    DP[1] = 1;
    prepare();
    for(int i = 2; i <= N; ++i)
        printf("%d ",dynamic(i));

    return 0;
}