#include <fstream>
#include <vector>
#include <queue>
#include <climits>
#define mod 104659
using namespace std;
ifstream fin("dmin.in");
ofstream fout("dmin.out");
int n,m,x,y,dmin[1501];
unsigned long long c,d[1501];
bool viz[1501];
struct muchie{
    int y;
    unsigned long long c;
};
struct cmp{
bool operator ()(muchie a, muchie b){
    return a.c>b.c;
}
};
vector<muchie>v[2501];
priority_queue<muchie,vector<muchie>,cmp>heep;
int main()
{
  fin>>n>>m;
  for(int i=1;i<=m;i++){
    fin>>x>>y>>c;
    v[x].push_back({y,c});
    v[y].push_back({x,c});
  }

    for(int i=2;i<=n;i++)
        d[i]=ULLONG_MAX;

    heep.push({1,0});
    //d[1]=0;
    dmin[1]=1;
    while(!heep.empty()){
        int k=heep.top().y;
        heep.pop();
        if(viz[k]==1)
            continue;
        viz[k]=1;
        for(auto next:v[k]){
            int nod=next.y;
            unsigned long long dist=next.c, prod=(d[k]+dist)%mod;
            if(prod<d[nod]){
                d[nod]=prod;
                heep.push({nod,d[nod]});
                dmin[nod]=dmin[k];
            }else if(prod==d[nod]){
                dmin[nod]=(dmin[nod]+dmin[k])%mod;
            }
        }
    }
    for(int i=2;i<=n;i++)
        fout<<dmin[i]<<" ";
    return 0;
}