#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
  return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
  return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const int oo = 1 << 30;
const long long loo = 1ll << 62;
const int mods = 1e9 + 7;
const int MAXN = 400005;
const int INF = 0x3f3f3f3f;
inline int read() {
  int f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
int to[MAXN], frm[MAXN], W[MAXN], f[MAXN], Frm[MAXN], d[20], Ans[20], w[20][20];
signed main() {
  int n = read(), m = read();
  for (int i = 1; i <= m; i++) {
    int x = read() - 1, y = read() - 1;
    w[x][y] = read();
    to[1 << x] |= 1 << y;
    frm[1 << y] |= 1 << x;
    d[y]++;
  }
  int p = 0;
  for (int i = 0; i < n; i++)
    if (!d[i]) p |= 1 << i;
  for (int i = 0; i < 1 << n; i++) {
    to[i] |= to[i ^ (i & (-i))] | to[i & (-i)] | p;
    frm[i] |= frm[i ^ (i & (-i))] | frm[i & (-i)];
  }
  for (int i = 0; i < 1 << n; i++)
    for (int x = 0; x < n; x++)
      if ((i >> x) & 1)
        for (int y = 0; y < n; y++)
          if (!((i >> y) & 1)) W[i] += w[x][y];
  for (int i = 1; i < 1 << n; i++) f[i] = INF;
  for (int i = 0; i < 1 << n; i++)
    for (int S = ((1 << n) - 1) ^ i, j = S; j; j = (j - 1) & S)
      if ((i & frm[j]) == frm[j] && f[i | j] > f[i] + W[i])
        f[i | j] = f[i] + W[i], Frm[i | j] = i;
  int nw = (1 << n) - 1, num = 0;
  while (nw) {
    ++num;
    for (int i = 0; i < n; i++)
      if (((nw ^ Frm[nw]) >> i) & 1) Ans[i] = num;
    nw = Frm[nw];
  }
  for (int i = 0; i < n; i++) printf("%d ", Ans[i]);
  return 0;
}
