#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << '{';
  string sep;
  for (const auto &x : v) os << sep << x, sep = ", ";
  return os << '}';
}
template <typename T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr) {
  os << '{';
  string sep;
  for (const auto &x : arr) os << sep << x, sep = ", ";
  return os << '}';
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
  cerr << ' ' << H;
  dbg_out(T...);
}
vector<int> topological_sort(const vector<vector<int>> &adj) {
  int n = int(adj.size());
  vector<int> in_degree(n, 0);
  vector<int> order;
  for (int i = 0; i < n; i++)
    for (int neighbor : adj[i]) in_degree[neighbor]++;
  for (int i = 0; i < n; i++)
    if (in_degree[i] == 0) order.push_back(i);
  int current = 0;
  while (current < int(order.size())) {
    int node = order[current++];
    for (int neighbor : adj[node])
      if (--in_degree[neighbor] == 0) order.push_back(neighbor);
  }
  return order;
}
template <typename T1, typename T2>
bool minimize(T1 &a, const T2 &b) {
  if (T1(b) < a) {
    a = T1(b);
    return true;
  }
  return false;
}
template <typename T_vector>
void output_vector(const T_vector &v, bool add_one = false, int start = -1,
                   int end = -1) {
  if (start < 0) start = 0;
  if (end < 0) end = int(v.size());
  for (int i = start; i < end; i++)
    cout << v[i] + (add_one ? 1 : 0) << (i < end - 1 ? ' ' : '\n');
}
const int INF = 1e9 + 5;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N, M;
  cin >> N >> M;
  vector<int> C(N, 0);
  vector<vector<int>> adj(N);
  vector<int> rev_mask(N, 0);
  for (int i = 0; i < M; i++) {
    int x, y, w;
    cin >> x >> y >> w;
    x--;
    y--;
    rev_mask[y] |= 1 << x;
    adj[x].push_back(y);
    C[x] += w;
    C[y] -= w;
  }
  vector<int> order = topological_sort(adj);
  vector<vector<int>> dp(N + 1, vector<int>(1 << N, INF));
  vector<vector<int>> prev_mask(N + 1, vector<int>(1 << N, 0));
  dp[0][0] = 0;
  for (int a = 0; a < N; a++) {
    vector<int> &dp_row = dp[a + 1];
    vector<int> &prev_row = prev_mask[a + 1];
    dp_row = dp[a];
    for (int add : order)
      for (int mask = 0; mask < 1 << N; mask++)
        if ((mask >> add & 1) == 0 && (rev_mask[add] & mask) == 0)
          if (minimize(dp_row[mask | 1 << add], dp_row[mask] + a * C[add]))
            prev_row[mask | 1 << add] = prev_row[mask] | 1 << add;
  }
  cerr << dp[N][(1 << N) - 1] << endl;
  vector<int> answers(N, -1);
  int row = N, mask = (1 << N) - 1;
  while (row > 0) {
    int take = prev_mask[row][mask];
    row--;
    for (int i = 0; i < N; i++)
      if (take >> i & 1) answers[i] = row;
    mask ^= take;
  }
  assert(mask == 0);
  output_vector(answers);
}
