#include<fstream>
#include<math.h>
using namespace std;
#define mod %104659
#define eps 1e-10
#define inf 1000000.000
ifstream f("dmin.in");
ofstream g("dmin.out");
template<class type>
struct nod
{	type info; nod *next;
};
struct pairr { int to; double cost; };
pairr mp(int x,double y) 
{	pairr c; c.to=x , c.cost=y; 
	return c; 
}
template<class type>
class queue
{	nod<type> *head,*tail; int dim;
	public:
		queue() { dim=0; }
		void create(type x)
		{	head=new nod<type>;
			head->next=NULL , head->info=x;
			tail=head , dim=1;
		}
		void push(type x)
		{	if(!dim) { create(x); return; }
			nod<type> *p=new nod<type>;
			p->info=x , p->next=NULL;
			tail->next=p;
			tail=p , dim++;
		}
		void pop()
		{	nod<type> *p=new nod<type>;
			p=head;
			head=head->next;
			delete p , dim--;
		}
		bool empty() { return dim==0; }
		type front() { type &x=head->info; return x; }
};
template<class type>
class vector
{	type *aux;
	int capacity,m_size;
	public:
		type *act;
		vector()
		{	act=new type[1]; capacity=1; m_size=0; }
		void reallocate()
		{	aux=new type[2*capacity] , capacity*=2;
			for(int i=0;i<m_size;i++) aux[i]=act[i];
			delete[] act;
			act=aux;
		}
		void push_back(type x)
		{	if(m_size==capacity)
				reallocate();
			act[m_size++]=x;
		}
		type operator [] (int x) { type &r=act[x]; return r; }
		int size() { return m_size; }
};
vector<pairr>a[1501];
double cmin[1501];
bool v[1501];
int way[1501];
queue<int>q;
void BF()
{	int i,k,j; double co; 
	q.push(1); v[1]=true;
	cmin[1]=0.00; way[1]=1;
	while(!q.empty())
	{	i=q.front(); q.pop(); v[i]=false;
		for(k=0;k<a[i].size();k++)
		{	j=a[i][k].to , co=a[i][k].cost;
			if(cmin[j]-cmin[i]-co>eps)
			{	cmin[j]=cmin[i]+co;
				way[j]=way[i];
				if(v[j]==false)
				{	q.push(j);
					v[j]=true;
				}
			}else if(cmin[i]+co-cmin[j]<=eps)
					way[j]=(way[j]mod+way[i]mod)mod;
		}
	}
}
int main()
{	int i,j,x,y,N,M; double c;
	f>>N>>M;
	for(i=1;i<=M;i++)
	{	f>>x>>y>>c;
		a[x].push_back(mp(y,log(c)));
		a[y].push_back(mp(x,log(c)));
	}
	for(i=1;i<=N;i++) cmin[i]=inf;
	BF();
	for(i=2;i<=N;i++)
		g<<way[i]<<" ";
	f.close();
	g.close();
	return 0;
}