#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
constexpr long long mod = 998244353;
const long long INF = mod * mod;
const long double eps = 1e-12;
const long double pi = acosl(-1.0);
long long mod_pow(long long x, long long n, long long m = mod) {
  if (n < 0) {
    long long res = mod_pow(x, -n, m);
    return mod_pow(res, m - 2, m);
  }
  if (abs(x) >= m) x %= m;
  if (x < 0) x += m;
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint& a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint& a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) {
  a = a / b;
  return a;
}
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[a - b];
}
int dp[19][1 << 18];
int pre[19][1 << 18];
int score[18];
int scoresum[1 << 18];
void solve() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> G(n);
  for (int i = 0; i < m; i++) {
    int x, y, c;
    cin >> x >> y >> c;
    x--;
    y--;
    G[x].push_back(y);
    score[x] += c;
    score[y] -= c;
  }
  for (int j = 0; j < (1 << n); j++) {
    for (int i = 0; i < n; i++)
      if (j & (1 << i)) scoresum[j] += score[i];
  }
  for (int i = 0; i < n + 1; i++)
    for (int j = 0; j < (1 << n); j++) dp[i][j] = mod;
  dp[0][0] = 0;
  vector<bool> upd(1 << n);
  upd[0] = true;
  for (int i = 0; i < n; i++) {
    vector<bool> nupd(1 << n, false);
    for (int j = 0; j < (1 << n); j++) {
      dp[i + 1][j] = dp[i][j];
      pre[i + 1][j] = j;
    }
    for (int j = 0; j < (1 << n); j++) {
      if (!upd[j]) continue;
      int t = 0;
      for (int k = 0; k < n; k++) {
        if (j & (1 << k)) continue;
        bool valid = true;
        for (int to : G[k]) {
          if (j & (1 << to)) {
          } else {
            valid = false;
          }
        }
        if (valid) t |= (1 << k);
      }
      for (int s = t;; s = (s - 1) & t) {
        if (s == 0) break;
        if (dp[i + 1][j ^ s] > dp[i][j] + i * scoresum[s]) {
          nupd[j ^ s] = true;
          dp[i + 1][j ^ s] = dp[i][j] + i * scoresum[s];
          pre[i + 1][j ^ s] = j;
        }
      }
    }
    swap(nupd, upd);
  }
  int mi = mod;
  int t = 0, chk = 0;
  for (int i = 0; i < n + 1; i++) {
    if (mi > dp[i][(1 << n) - 1]) {
      mi = dp[i][(1 << n) - 1];
      t = i;
      chk = (1 << n) - 1;
    }
  }
  vector<int> ans(n, 0);
  while (t > 0) {
    int nex = pre[t][chk];
    int dif = nex ^ chk;
    for (int j = 0; j < n; j++)
      if (dif & (1 << j)) ans[j] = t;
    t--;
    chk = nex;
  }
  for (int i = 0; i < n; i++) {
    if (i > 0) cout << " ";
    cout << ans[i];
  }
  cout << "\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}
