/**
* author: NimaAryan
* created: 2024-08-11 17:08:02
**/
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "algo/debug.h"
#endif
using i64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<array<int, 3>> e(m);
for (int i = 0; i < m; ++i) {
int l, r, k, value;
cin >> l >> r >> k >> value;
++r;
if (value == 1) {
e[i] = {l, r, k - 1};
} else {
e[i] = {r, l, -k};
}
}
for (int i = 0; i + 1 <= n; ++i) {
e.push_back({i, i + 1, 1});
e.push_back({i + 1, i, 0});
}
constexpr int inf = 1E9;
vector<int> s(n + 1, inf);
s[0] = 0;
int last = -1;
for (int it = 0; it < n; ++it) {
for (auto [i, j, w] : e) {
if (s[i] + w < s[j]) {
s[j] = s[i] + w;
last = it;
}
}
if (last != it) {
break;
}
}
if (last + 1 == n) {
cout << -1 << "\n";
return 0;
}
for (int i = 0; i < n; ++i) {
cout << !(s[i + 1] - s[i]) << " \n"[i + 1 == n];
}
return 0;
}
