#include <cstdio>
#include <set>
#include <cmath>
#define DIM 50005
#define mp make_pair
#define MOD 104659

using namespace std;
const int INF = (1<<30)-5;
const double eps = 1e-10;
struct nod
{
    int x;
	double cost;
    nod *next;
};
nod *G[DIM];

int n, m, uz[DIM], v[DIM];
double d[DIM];
 set< pair<double, int>  > S;



void addMuchie(int i, int j, int cost)
{
    nod *p = new nod;
    p->x = j;
    p->cost = log(cost);
    p->next = G[i];
    G[i] = p;

}

int minimul()
{
	int min = INF, ibun = -1;
	for (int i = 1; i <= n; ++i)
		if (v[i]==0 && d[i] < min)
			min = d[i], ibun = i;
	
	return ibun;
}

void dijkstra()
{
  // S.insert(mp(0, 1));

   d[1] = 0;
   v[1] = 1;
   int i, gata = 0;
   uz[1] = 1;
   for (nod *p = G[1]; p; p = p -> next)
		d[p->x]=p->cost, uz[p->x]=1;
   while (!gata)
   {
	   gata= 1;
      i = minimul();
	  if(i==-1)
		break;
      v[i] = 1;

  //    S.erase(*S.begin());
       
      for (nod *p = G[i]; p; p = p -> next)
       if (!v[p->x])
      {
		  if (d[p->x] > d[i] + p->cost+eps)
                    d[p->x] = d[i] + p->cost,uz[p->x] = uz[i], gata = 0;
		  else
            if   (abs(d[p->x] - (d[i] + p->cost)) <= eps)
					uz[p->x] += uz[i] , uz[p->x] %= MOD, gata = 0;
            else;
                

            //printf("%d %d %lf %d\n", i, p->x, d[p->x], uz[p->x]);

      }

   }

}

int main()
{
    FILE *f = fopen("dmin.in", "r");
    fscanf(f, "%d%d", &n, &m);
    for (int i = 1; i <= n; ++i)
        d[i] = INF, uz[i] = 0;
	for (int x, y, c; m; --m)
    {
        fscanf(f, "%d%d%d", &x, &y, &c);
        addMuchie(x, y, c);
		addMuchie(y, x, c);

    }
    fclose(f);

    dijkstra();
    f = fopen("dmin.out", "w");

    for (int i = 2; i <= n; ++i)
        fprintf(f, "%d ", uz[i]);
//	for (int i = 1; i <= n; ++i)
 //       printf( "%d ", (int)exp(d[i]));
    fclose(f);

    return 0;
}