#include<fstream.h>
#include<math.h>
#define _DIM_ 1501
#define modulo 104659
#define eps 0.01


ifstream f("dmin.in");
ofstream g("dmin.out");
typedef struct _lista
	{
	int x,c;
	_lista *urm;
	}*Lista;
typedef struct _nod
	{
	Lista l;
	}Nod;
Nod V[_DIM_];
float c[_DIM_];
long mod[_DIM_];
int v[_DIM_],coada[_DIM_],n,m,p,u;
void adauga(int x,int y,int cost)
	{
	Lista nou=new _lista;
	nou->x=y;nou->c=cost;
	nou->urm=V[x].l;
	V[x].l=nou;
	}
void citire()
	{
	int i,cost,x,y;
	f>>n>>m;
	for(i=1;i<=m;i++)
		f>>x>>y>>cost,adauga(x,y,cost),adauga(y,x,cost);
	}
int getmin(int p,int u)
	{
	int i;
	float min=c[coada[p]];
	int minpoz=p;
	for(i=p+1;i<=u;i++)
		if(min>c[coada[i]])min=c[coada[i]],minpoz=i;
	return minpoz;
	}
void dijkstra(int k)
	{
	Lista i;
	p=u=1;coada[1]=k;
	v[k]=1;c[k]=1;
	while(p<=u)
		{
		k=getmin(p,u);
		for(i=V[k].l;i;i=i->urm)
			if(!v[i->x])
				coada[++u]=i->x,v[i->x]=1,
							c[i->x]=c[k]*i->c;

			else
				if(c[i->x]>c[k]*i->c)
					c[i->x]=c[k]*i->c;
		p++;
		}
	}
int main()
{
int i,k;
Lista j;
citire();f.close();
dijkstra(1);
mod[1]=1;
for(i=1;i<=u;i++)
	{
	k=coada[i];
	for(j=V[k].l;j;j=j->urm)
		if(c[k]*j->c==c[j->x])
			mod[j->x]=(mod[j->x]+mod[k])%modulo;
	}
for(i=2;i<=n;i++)
	g<<mod[i]%modulo<<" ";
g<<"\n";
g.close();
return 0;
}