#include <bits/stdc++.h>
#define pii pair<int,int>
#define fs first
#define sc second
#define pb push_back
#define zeros(x) x&(-x)
#define all(v) v.begin(), v.end()
#define MOD 104659
#define oo 2000000000
#define pii pair<int,int>
#define ll long long
#define ld long double
#define ull unsigned long long
#define mem(a) memset(a,0,sizeof(a))
#define pi 3.14159265359
#define NMax 60
using namespace std;
ifstream fin("dmin.in");
ofstream fout("dmin.out");

double d[1510];
int rez[1510];
bool viz[1510];
vector <pair<int,double>> v[1510];
queue<int> q;
int i,j,n,m,x,y,c;

double eps = 0.0000000001;

bool eq(double a, double b) {
   return fabs(a-b)<=eps;
}

int compute(int x)
{
    if(rez[x] != 0) return rez[x];

    for(auto nod : v[x])
    {
        if(eq(d[x],d[nod.fs] + nod.sc))
            {
                rez[x] += compute(nod.fs);
                rez[x] %=MOD;
            }

    }
    return rez[x];
}

int main()
{
    fin>>n>>m;

    for(i=1; i<=m; ++i)
    {
        fin>>x>>y>>c;

        v[x].pb({y,log2(c)});
        v[y].pb({x,log2(c)});
    }

    for(i=2; i<=n; ++i) d[i] = oo;
    q.push(1);
    viz[1] = 1;

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        viz[nod] = 0;

        for(auto x : v[nod])
        {
           double c = x.sc;

            if(d[nod] + c < d[x.fs])
            {
                d[x.fs] = d[nod]+ c;
                if(!viz[x.fs])
                {
                    q.push(x.fs);
                    viz[x.fs] = 1;
                }
            }
        }
    }

    rez[1] = 1;
    for(i=2;i<=n;++i)
    {
        if(rez[i] == 0)
            rez[i] = compute(i);
    }

    for(i=2;i<=n;++i)
        fout<<rez[i]<<" ";

    return 0;
}