#include <bits/stdc++.h>
using namespace std;
inline char nc() {
  static char buf[100000], *p1 = buf, *p2 = buf;
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline int read() {
  register int x = 0, f = 1;
  register char ch = nc();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = nc();
  }
  while (ch >= '0' && ch <= '9') x = (x << 3) + (x << 1) + ch - '0', ch = nc();
  return x * f;
}
inline void write(register int x) {
  if (!x) putchar('0');
  if (x < 0) x = -x, putchar('-');
  static int sta[20];
  register int tot = 0;
  while (x) sta[tot++] = x % 10, x /= 10;
  while (tot) putchar(sta[--tot] + 48);
}
int n, m, lim, a[20], w[20], sum[(1 << 18) + 5], ban[(1 << 18) + 5],
    to[(1 << 18) + 5], f[(1 << 18) + 5], pre[(1 << 18) + 5], cnt,
    ans[(1 << 18) + 5];
vector<int> e[20];
inline void get(register int msk) {
  if (msk == 0) return;
  get(pre[msk]);
  ++cnt;
  for (register int i = 0; i < n; ++i)
    if ((1 << i) & (msk ^ pre[msk])) ans[i + 1] = cnt;
}
int main() {
  n = read(), m = read(), lim = 1 << n;
  for (register int i = 1; i <= m; ++i) {
    int u = read(), v = read(), w = read();
    a[u] += w, a[v] -= w;
    e[u].push_back(v);
  }
  for (register int i = 0; i < lim; ++i) {
    for (register int j = 0; j < n; ++j)
      if (i & (1 << j)) sum[i] += a[j + 1], w[j + 1] = 1;
    for (register int j = 0; j < n; ++j)
      if ((i & (1 << j))) {
        for (register int k = 0; k < (int)e[j + 1].size(); ++k) {
          if (w[e[j + 1][k]]) ban[i] = 1;
          to[i] |= 1 << (e[j + 1][k] - 1);
        }
      }
    for (register int j = 0; j < n; ++j) w[j + 1] = 0;
  }
  memset(f, 0x3f, sizeof(f));
  f[0] = 0;
  for (register int i = 1; i < lim; ++i) {
    for (register int j = i;; j = (j - 1) & i) {
      if ((j == i) || (f[j] == 0x3f3f3f3f) || ban[i ^ j] || (to[j] & (i ^ j))) {
        if (j == 0) break;
        continue;
      }
      if (f[j] + sum[(lim - 1) ^ j] < f[i]) {
        f[i] = f[j] + sum[(lim - 1) ^ j];
        pre[i] = j;
      }
      if (j == 0) break;
    }
  }
  get(lim - 1);
  for (register int i = 1; i <= n; ++i) write(ans[i]), putchar(' ');
  return 0;
}
