#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, int> pli;
typedef pair <ll, ll> pll;
typedef long double ld;
#define mp make_pair
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 2000 + 7;
int n, q, prefix[N];
bool pushed[N];

vector <pii> c[N];

void push(int a) {
        pushed[a] = 1;
        for (auto &it : c[a]) {
                int b = it.first, addup = it.second;
                if (pushed[b] == 0) {
                        prefix[b] = prefix[a] + addup;
                        push(b);
                }
        }
}

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

        cin >> n >> q;

        for (int i = 1; i <= q; i++) {
                int l, r, a;
                cin >> l >> r >> a;
                l--;
                c[l].pb(mp(r, a));
                c[r].pb(mp(l, -a));
        }

        for (int i = 0; i <= n; i++)
                if (pushed[i] == 0)
                        push(i);

        for (int i = 1; i <= n; i++) {
                int a = prefix[i] - prefix[i - 1];
                cout << a << " ";
        }
        cout << "\n";

        return 0;
}