#include<fstream>
#include<vector>
#define inf 2000000000
using namespace std;
vector <pair <int, int> > L[1502];
int n, m, x, y, z, i, D[1502], nr[1502], p[1502], h[1502], nod, p1, s, nrh, vecin, cost;
ifstream in("dmin.in");
ofstream out("dmin.out");
int main()
{
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y>>z;
        L[x].push_back(make_pair(y, z));
        L[y].push_back(make_pair(x, z));
    }
    for(i=2; i<=n; i++)
        D[i]=inf;
    D[1]=1;
    nr[1]=1;
    h[++nrh]=1;
    p[1]=nrh;
    while(nrh!=0)
    {
        nod=h[1];
        h[1]=h[nrh];
        nrh--;
        p1=1;
        s=2;
        while(s<=nrh)
        {
            if(s+1<=nrh && D[h[s+1]]<D[h[s]])
                s++;
            if(D[h[s]]<D[h[p1]])
            {
                swap(h[s], h[p1]);
                p[h[s]]=s;
                p[h[p1]]=p1;
                p1=s;
                s*=2;
            }
            else
                break;
        }
        for(i=0; i<L[nod].size(); i++)
        {
            vecin=L[nod][i].first;
            cost=L[nod][i].second;
            if(D[vecin]>D[nod]*cost)
            {
                nr[vecin]=nr[nod];
                D[vecin]=D[nod]*cost;
                if(p[vecin]!=0)
                {
                    s=p[vecin];
                    p1=s/2;
                }
                else
                {
                    h[++nrh]=vecin;
                    p[vecin]=nrh;
                    s=nrh;
                    p1=s/2;
                }
                while(p1!=0 && D[h[s]]<D[h[p1]])
                {
                    swap(h[s],  h[p1]);
                    p[h[s]]=s;
                    p[h[p1]]=p1;
                    s=p1;
                    p1/=2;
                }
            }
            else
                if(D[vecin]==D[nod]*cost)
                    nr[vecin]+=nr[nod];
        }
    }
    for(i=2; i<=n; i++)
        out<<nr[i]%104659<<" ";
    return 0;
}