#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#define maxN 1502
#define inf 2000000000.0
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define e 0.0000000001
#define mod 104659
using namespace std;
int n, m, i, j, sol[maxN];
double d[maxN];
bool inq[maxN];
vector < pair< int, double > > V[maxN];
queue < int > Q;
void read()
{
    int x, y;
    double c;
    freopen("dmin.in", "r", stdin);
    scanf("%d %d", &n, &m);
    while (m --)
    {
        scanf("%d %d %lf", &x, &y, &c);
        c = log(c);
        V[x].pb(mp(y, c));
        V[y].pb(mp(x, c));
    }
}
void solve()
{
    int x, node;
    for (i = 2; i <= n; ++ i)
        d[i] = inf;

    Q.push(1);
    sol[1] = 1;
    while (!Q.empty())
    {
        x = Q.front();
        inq[x] = 0;
        Q.pop();
        for (i = 0; i < V[x].size(); ++ i)
        {
            node = V[x][i].f;
            if (d[node] - (d[x] + V[x][i].s) > e)
            {
                d[node] = d[x] + V[x][i].s;
                sol[node] = sol[x];
                inq[node] = 1;
                Q.push(node);
            }
            else if (fabs(d[node] - d[x] - V[x][i].s) <= e)
            {
                sol[node] = (sol[x] + sol[node]) % mod;
                if (!inq[node])
                {
                    inq[node] = 1;
                    Q.push(node);
                }
            }
        }
    }
}
void write()
{
    freopen("dmin.out", "w", stdout);
    for (i = 2; i <= n; ++ i)
        printf("%d ", sol[i]);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}