#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
void chkmin(T1 &x, T2 y) {
  if (x > y) x = y;
}
template <typename T1, typename T2>
void chkmax(T1 &x, T2 y) {
  if (x < y) x = y;
}
namespace fastio {
char rbuf[1 << 23], *p1 = rbuf, *p2 = rbuf, wbuf[1 << 23], *p3 = wbuf;
inline char getc() {
  return p1 == p2 &&
                 (p2 = (p1 = rbuf) + fread(rbuf, 1, 1 << 23, stdin), p1 == p2)
             ? -1
             : *p1++;
}
inline void putc(char x) { (*p3++ = x); }
template <typename T>
void read(T &x) {
  x = 0;
  char c = getchar();
  T neg = 0;
  while (!isdigit(c)) neg |= !(c ^ '-'), c = getchar();
  while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  if (neg) x = (~x) + 1;
}
template <typename T>
void recursive_print(T x) {
  if (!x) return;
  recursive_print(x / 10);
  putc(x % 10 ^ 48);
}
template <typename T>
void print(T x) {
  if (!x) putc('0');
  if (x < 0) putc('-'), x = ~x + 1;
  recursive_print(x);
}
void print_final() { fwrite(wbuf, 1, p3 - wbuf, stdout); }
}  // namespace fastio
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const long long DELTA = 1e10;
const int MAXN = 100;
const int MAXV = 15000;
const int MAXE = 1e6;
int n, m, S, T, a[MAXN + 5];
int id(int x, int y) { return (x - 1) * (n + 1) + y; }
int hd[MAXV + 5], to[MAXE + 5], nxt[MAXE + 5], ec = 1;
long long cap[MAXE + 5];
void adde(int u, int v, long long f) {
  to[++ec] = v;
  cap[ec] = f;
  nxt[ec] = hd[u];
  hd[u] = ec;
  to[++ec] = u;
  cap[ec] = 0;
  nxt[ec] = hd[v];
  hd[v] = ec;
}
int dep[MAXV + 5], now[MAXV + 5];
bool getdep() {
  memset(dep, -1, sizeof(dep));
  dep[S] = 0;
  queue<int> q;
  q.push(S);
  now[S] = hd[S];
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    for (int e = hd[x]; e; e = nxt[e]) {
      int y = to[e];
      long long z = cap[e];
      if (z && !~dep[y]) {
        dep[y] = dep[x] + 1;
        now[y] = hd[y];
        q.push(y);
      }
    }
  }
  return ~dep[T];
}
long long getflow(int x, long long f) {
  if (x == T) return f;
  long long ret = 0;
  for (int &e = now[x]; e; e = nxt[e]) {
    int y = to[e];
    long long z = cap[e];
    if (dep[y] == dep[x] + 1 && z) {
      long long w = getflow(y, min(f - ret, z));
      cap[e] -= w;
      cap[e ^ 1] += w;
      ret += w;
      if (ret == f) return ret;
    }
  }
  return ret;
}
long long dinic() {
  long long ret = 0;
  while (getdep()) ret += getflow(S, INF);
  return ret;
}
int main() {
  scanf("%d%d", &n, &m);
  S = n * (n + 1) + 1;
  T = n * (n + 1) + 2;
  for (int i = 1, u, v, w; i <= m; i++) {
    scanf("%d%d%d", &u, &v, &w);
    a[u] += w;
    a[v] -= w;
    for (int j = 1; j <= n; j++) adde(id(v, j), id(u, j + 1), INF);
  }
  for (int i = 1; i <= n; i++) {
    adde(S, id(i, 1), INF);
    for (int j = 1; j <= n; j++)
      adde(id(i, j), id(i, j + 1), DELTA + 1ll * (j - 1) * a[i]);
    adde(id(i, n + 1), T, INF);
  }
  dinic();
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n + 1; j++) {
      if (!~dep[id(i, j)]) {
        printf("%d ", j - 1);
        break;
      }
    }
  return 0;
}
