#include <bits/stdc++.h>
#warning That's not the baby, that's my baby

typedef long long ll;

using namespace std;

/**
sum[j] --- suma ---> sum[i - 1]
**/

const int NMAX = 2000;

vector<pair<int, int>>g[NMAX + 5];
bitset<NMAX + 5>vis;
int sum[NMAX + 5];

void dfs (int u) {
    vis[u] = true;
    for (const auto &[v, s] : g[u]) {
        if (!vis[v]) {
            sum[v] = sum[u] - s;
            dfs(v);
        }
    }
}

int main() {
    #ifdef INFOARENA
        freopen("reconst.in", "r", stdin);
        freopen("reconst.out", "w", stdout);
    #endif

    int n, m;
    cin >> n >> m;

    while (m--) {
        int l, r, s;
        cin >> l >> r >> s;
        g[r].push_back({l - 1, s});
        g[l - 1].push_back({r, -s});
    }

    for (int i = 0; i <= n; i++) {
        if (!vis[i]) {
            sum[i] = 0;
            dfs(i);
        }
    }

    for (int i = 1; i <= n; i++) {
        cout << sum[i] - sum[i - 1] << ' ';
    }

    return 0;
}