#include <bits/stdc++.h>

using namespace std;
ifstream fin("dmin.in");
ofstream fout("dmin.out");
int n,m,d[1505],viz[1505],k[1505];
vector<pair<int,int>>v[1505];
priority_queue<pair<int,int>>q;
void citire()
{
    int x,y,cost;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        v[x].push_back({y,cost});
        v[y].push_back({x,cost});
    }
    for(int i=1;i<=n;i++)
        d[i]=INT_MAX;
}
void dijkstra(int start)
{
    for(int i=1;i<=n;i++)
        viz[i]=0;
    d[start]=1;
    q.push({0,start});
    while(!q.empty())
    {
        int x=q.top().second;
        q.pop();
        for(auto i:v[x])
        {
            if((d[x]%104659*i.second%104659)%104659<d[i.first]%104659)
            {
                d[i.first]=(d[x]%104659*i.second%104659)%104659;
                k[i.first]=1;
                    q.push({-d[i.first],i.first});
            }
            else if(d[x]*i.second==d[i.first]){
                k[i.first]=(k[i.first]+1)%104659;
                    q.push({-d[i.first],i.first});
            }
        }
    }
}
void afisare()
{
    for(int i=2;i<=n;i++)
        fout<<k[i]<<" ";
}
int main()
{
    citire();
    dijkstra(1);
    afisare();
    return 0;
}