#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dmin.in");
ofstream fout("dmin.out");
#define NMAX 15007
#define MOD 104659
vector <int> v[NMAX],cost[NMAX];
long double drum[NMAX],eps;
int nr[NMAX],baga[NMAX],n,m;
long double modul(long double a)
{
    if(a<0) return -a;
    return a;
}
void read()
{
    int a,b,c;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        v[a].push_back(b);
        v[b].push_back(a);
        cost[a].push_back(c);
        cost[b].push_back(c);
    }
}
void tipar()
{
    fout<<n<<" "<<m<<" ------- READ GRAPH:\n";
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<v[i].size();j++)
            fout<<i<<" "<<v[i][j]<<" "<<cost[i][j]<<"\n";
    }
}
void tipar_drum()
{
    for(int i=1;i<=n;i++)
        fout<<nr[i]<<" ";
    fout<<" | ";
    for(int i=1;i<=n;i++)
        fout<<baga[i]<<" ";
    fout<<"\n";
   // fout<<"\n    ";
  //  for(int i=1;i<=n;i++)
  //      fout<<drum[i]<<" ";
  //  fout<<"\n";
}
void bfs()
{
    int nod;
    long double aux;
    drum[1]=1;
    //nr[1]=1;
    baga[1]=1;
    queue <int> qnod;
    qnod.push(1);
    while(!qnod.empty())
    {
        nod=qnod.front();
        qnod.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            aux=drum[nod]*cost[nod][i];
            if(drum[v[nod][i]] == 0 || drum[v[nod][i]]  > eps + aux)
            {
                drum[v[nod][i]] = aux;
               // nr[v[nod][i]] = nr[nod];
                baga[v[nod][i]] = baga[nod];
                nr[v[nod][i]] = 0;
                qnod.push(v[nod][i]);
                if(nr[v[nod][i]] > MOD)
                    nr[v[nod][i]] -= MOD;
            }
            else
            if(modul(drum[v[nod][i]] - aux)<= eps)
            {
                baga[v[nod][i]] += baga[nod];
               // nr[v[nod][i]] = nr[nod];
                if(baga[v[nod][i]] > MOD)
                    baga[v[nod][i]] -= MOD;
                qnod.push(v[nod][i]);
            }
          //  fout<<nod<<" | ";
            //   tipar_drum();
        }
        nr[nod]+=baga[nod];
        baga[nod]=0;
        if(nr[nod]>MOD) nr[nod]-=MOD;
    }
}
int main()
{
    read();
   // tipar();
    eps=1e-10;
    bfs();
   // tipar_drum();
    for(int i=2;i<=n;i++)
        fout<<nr[i]<<" ";
    //fout<<modul(-eps);
}