#include <queue>
#include <cmath>
#include <vector>
#include <fstream>
#include <iostream>
#define MOD 104659
#define NM 1510
#define eps 1e-10
#define inf 0x3f3f3f3f
using namespace std;

ifstream f("dmin.in");
ofstream g("dmin.out");

vector < pair < int, double  > > graf[NM];
queue < int > q;
double c[NM];
int sol[NM], n, m;

int main()
{
    int x, y, cs ,nod, nod2, cost;
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y >> cs;
        graf[x].push_back(make_pair(y, log2(cs)));
        graf[y].push_back(make_pair(x, log2(cs)));
    }
    c[1] = 0;
    for(int i = 2; i <= n; ++i) c[i] = inf;
    q.push(1);
    sol[1] = 1;
    while(!q.empty())
    {
        nod = q.front();
        q.pop();
        for(int i = 0; i < graf[nod].size(); ++i)
        {
            nod2 = graf[nod][i].first;
            cost = graf[nod][i].second;
            if(c[nod2] - (c[nod] + cost) > eps)
            {
                c[nod2] = c[nod] + cost;
                sol[nod2] = sol[nod];
                q.push(nod2);
            }
            else if( abs( c[nod2] - ( c[nod] + cost )) <= eps )
            {
                sol[nod2] += sol[nod];
                if(sol[nod2] >= MOD) sol[nod2] -= MOD;

            }
        }
    }
    for(int i = 2; i <= n; ++i) g << sol[i] << ' ';
}