#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#define mod 104659
#define inf 0x3f3f3f3f
#define N 1505

using namespace std;

vector <pair <int, int> > g[N];
vector <pair <int, int> > ::iterator it;
queue <int> q;
int n, m, cost[N], viz[N], nr[N];

void citire()
{
    scanf("%d %d\n", &n, &m);
    for(int i=0;i<m;i++)
    {
        int x, y, c;
        cost[i]=inf;
        scanf("%d %d %d\n", &x, &y, &c);
        g[x].push_back({y, c});
    }
}

void parcurg(int nod)
{
    for(it=g[nod].begin();it!=g[nod].end();it++)
        if(it->second*cost[nod]<cost[it->first])
        {
            cost[it->first]=it->second*cost[nod];
            nr[it->first]=1;
            q.push(it->first);
        }
        else
            if(it->second*cost[nod]==cost[it->first])
                nr[it->first]++;
}

void afisare()
{
    for(int i=3;i<=n;i++)
        nr[i]=(1LL*nr[i]*nr[i-1])%mod;
    for(int i=2;i<=n;i++)
        printf("%d ", nr[i]);
}

void bellman()
{
    q.push(1);
    cost[1]=1;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        viz[x]++;
        parcurg(x);
    }
}

int main()
{
    freopen("dmin.in", "r", stdin);
    freopen("dmin.out", "w", stdout);

    citire();
    bellman();
    afisare();
    return 0;
}