//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @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;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            lgr[i][j] = 0;
            rgr[i][j] = j - i + 1;
        }
    }
    for (int i = 0; i < m; ++i) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        if (d == 1) {
            lgr[a][b] = max(lgr[a][b], b - a + 1 - c + 1);
        } else {
            rgr[a][b] = min(rgr[a][b], b - a + 1 - c);
        }
    }
    for (int lenka = 0; lenka < n; ++lenka) {
        for (int i = 0; i + lenka + 1 < n; ++i) {
            int j = i + lenka;
            lgr[i][j+1] = max(lgr[i][j+1], lgr[i][j]);
            rgr[i][j+1] = min(rgr[i][j+1], rgr[i][j] + 1);
        }
        for (int i = 1; i + lenka < n; ++i) {
            int j = i + lenka;
            lgr[i-1][j] = max(lgr[i-1][j], lgr[i][j]);
            rgr[i-1][j] = min(rgr[i-1][j], rgr[i][j] + 1);
        }
    }
    for (int lenka = n - 1; lenka > 0; --lenka) {
        for (int i = 0; i + lenka < n; ++i) {
            int j = i + lenka;
            lgr[i][j-1] = max(lgr[i][j-1], lgr[i][j] - 1);
            lgr[i+1][j] = max(lgr[i+1][j], lgr[i][j] - 1);
            rgr[i][j-1] = min(rgr[i][j-1], rgr[i][j]);
            rgr[i+1][j] = min(rgr[i+1][j], rgr[i][j]);
        }
    }
    string res(n, '?');
    for (int i = 0; i < n; ++i) {
        int op = 3;
        for (int j = i; j < n; ++j) {
            if (lgr[i][j] > rgr[i][j]) {
                cout << "-1\n";
                return;
            }
            if (lgr[i][j] == rgr[i][j]) {
                if (lgr[i][j] == 0) {
                    op &= 1;
                } else if (lgr[i][j] == j - i + 1) {
                    op &= 2;
                }
            }
            if (i != j) {
                if (lgr[i][j] > rgr[i + 1][j]) {
                    op &= 2;
                }
                if (rgr[i][j] == lgr[i + 1][j]) {
                    op &= 1;
                }
            }
        }
        if (op & 1)
            res[i] = '0';
        else
            res[i] = '1';
        //cout << op << '\n';
        for (int j = i + 1; j < n; ++j) {
            lgr[i+1][j] = max(lgr[i+1][j], lgr[i][j] - (res[i] == '1'));
            rgr[i+1][j] = min(rgr[i+1][j], rgr[i][j] - (res[i] == '1'));
        }
    }
    for (auto i : res)
        cout << i << ' ';
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    while (t--) {
        solve();
    }
}