#include <bits/stdc++.h>
using namespace std;
const int N = 19, M = (1 << 18) + 5, INF = (int)2e9;
int n, m;
int rc[N], w[N];
int dp[N][M], mk[N][M];
vector<int> G[N];
int res[N];
int in[N];
vector<int> idx;
int dfs(int v) {
  if (rc[v] != -1) return rc[v];
  rc[v] = (1 << v);
  for (int nxt : G[v]) {
    rc[v] |= dfs(nxt);
  }
  return rc[v];
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m;
  for (int i = 0; i < (m); ++i) {
    int u, v, x;
    cin >> u >> v >> x;
    u--, v--;
    w[u] += x;
    w[v] -= x;
    G[u].push_back(v);
    in[v]++;
  }
  memset(rc, -1, sizeof(rc));
  for (int i = 0; i < (n); ++i)
    if (rc[i] == -1) dfs(i);
  for (int i = 0; i < (n); ++i) rc[i] ^= (1 << i);
  queue<int> que;
  for (int i = 0; i < (n); ++i)
    if (in[i] == 0) que.push(i), idx.push_back(i);
  while (!que.empty()) {
    int v = que.front();
    que.pop();
    for (int nxt : G[v]) {
      in[nxt]--;
      if (in[nxt] == 0) {
        que.push(nxt);
        idx.push_back(nxt);
      }
    }
  }
  for (int i = 0; i < N; i++) fill(dp[i], dp[i] + M, INF);
  dp[0][0] = 0;
  for (int i = 0; i < (n); ++i) {
    if (i > 0)
      for (int mask = 0; mask < ((1 << n)); ++mask)
        dp[i][mask] = dp[i - 1][mask];
    for (int nxt : idx) {
      for (int mask = 0; mask < ((1 << n)); ++mask) {
        if (dp[i][mask] != -INF && !(mask >> nxt & 1) &&
            ((mask | rc[nxt]) == mask)) {
          if (dp[i][mask] + w[nxt] * i < dp[i][mask | (1 << nxt)]) {
            dp[i][mask | (1 << nxt)] = dp[i][mask] + w[nxt] * i;
            mk[i][mask | (1 << nxt)] = mk[i][mask] | (1 << nxt);
          }
        }
      }
    }
  }
  int cur = (1 << n) - 1;
  for (int i = n - 1; i >= 0; i--) {
    for (int j = 0; j < n; j++) {
      if (mk[i][cur] >> j & 1) res[j] = i;
    }
    cur ^= mk[i][cur];
  }
  for (int i = 0; i < (n); ++i) cout << res[i] << " ";
  cout << "\n";
}
