#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
signed main() {
int n, m;
cin >> n >> m;
vector<array<int, 3> > edges;
for(int i=0; i<m; i++) {
int l, r, k, val;
cin >> l >> r >> k >> val; l++; r++;
if(val == 0) edges.push_back({ l - 1, r, r - l + 1 - k});
else edges.push_back({ r, l - 1, -(r - l + 1) + k - 1 });
}
for(int i=1; i<=n; i++) edges.push_back({ i-1, i, 1 });
for(int i=1; i<=n; i++) edges.push_back({ i, i-1, 0 });
vector<ll> dist(n+1, 1e9); dist[0] = 0;
for(int i=1; i<=n; i++)
for(auto &[u, v, w] : edges) dist[v] = min(dist[v], dist[u] + w);
for(auto &[u, v, w] : edges) {
if(dist[v] > dist[u] + w) {
cout << -1 << '\n';
return 0;
}
}
for(int i=1; i<=n; i++) cout << (dist[i] > dist[i-1]) << " ";
return 0;
}
