//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
int lgr[5000][5000];
int rgr[5000][5000];
int prfsm1[5001];
int prfempt[5001];
void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> res(n+1, n + 2);
    res[0] = 0;
    vector<array<int, 3>> edgs;
    for (int i = 0; i < n; ++i) {
        edgs.push_back({i, i + 1, 1});
        edgs.push_back({i + 1, i, 0});
    }
    for (int i = 0; i < m; ++i) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        if (d == 1) {
            edgs.push_back({b+1, a, b - a + 1 - c + 1});
            //lgr[a][b] = max(lgr[a][b], b - a + 1 - c + 1);
        } else {
            edgs.push_back({a, b+1, b - a + 1 - c});
            //rgr[a][b] = min(rgr[a][b], b - a + 1 - c);
        }
    }
    for (int i = 0; i < n; ++i) {
        for (auto [a, b, c] : edgs) {
            res[b] = min(res[b], res[a] + c);
        }
    }
    bool ok = 1;
    for (auto [a, b, c] : edgs) {
        if (res[b] != min(res[b], res[a] + c))
            ok = 0;
        res[b] = min(res[b], res[a] + c);
    }
    if (ok == 0) {
        cout << "-1\n";return;
    }
    for (int i = 0; i < n; ++i) {
        cout << res[i + 1] - res[i] << ' ';
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    while (t--) {
        solve();
    }
}