#include <bits/stdc++.h>
using namespace std;

const double eps = 1e-9;
const int MOD = 104659;

int n, m;
double cost[1501];
int ways[1501];
vector<pair<int, int>> v[1501];

void dijkstra() {
    priority_queue<pair<double, int>, vector<pair<double, int>>, greater<pair<double, int>>> q;
    for (int i = 1; i <= n; ++i) {
        cost[i] = 1e18;
    }
    q.push({0, 1});
    cost[1] = 0;
    while (!q.empty()) {
        int node = q.top().second;
        double qcost = q.top().first;
        //cout << node << " ";
        q.pop();
        if (!abs(qcost - cost[node]) <= eps) {
            continue;
        }
        for (int i = 0; i < v[node].size(); ++i) {
            double logCost = log2(v[node][i].second);
            if (cost[v[node][i].first] - cost[node] - logCost > eps) {
                cost[v[node][i].first] = cost[node] + logCost;
                q.push({cost[v[node][i].first], v[node][i].first});
                ways[v[node][i].first] = 1;
            } else if (cost[v[node][i].first] - cost[node] - logCost >= -1) {
                ways[v[node][i].first] = (ways[v[node][i].first] + 1) % MOD;
                q.push({cost[v[node][i].first], v[node][i].first});
            }
        }
    }
}

int main() {
    ifstream cin("dmin.in");
    ofstream cout("dmin.out");
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y, c;
        cin >> x >> y >> c;
        v[x].push_back({y, c});
        v[y].push_back({x, c});
    }
    dijkstra();
    for (int i = 2; i <= n; ++i) {
        cout << ways[i] << " ";
    }
}