#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#define private public
#include<atcoder/all>
#undef private
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<tuple<int, int, int, int>> cs(m);
  vector<vector<P>> cs2(2 * n);
  for(auto& [p, q, a, b]: cs) {
    cin >> p >> q >> a >> b, p--, q--, a--, b--;
    if (a && b) {
      a--, b--;
      cs2[2 * p + !a].emplace_back(q, b);
      cs2[2 * q + !b].emplace_back(p, a);
    }
  }
  dsu d(2 * n);
  for(auto [p, q, a, b]: cs) {
    d.merge(2 * p + !a, 2 * q + b);
    d.merge(2 * p + a, 2 * q + !b);
  }
  rep(i, n) if (d.same(2 * i, 2 * i + 1)) {
    cout << -1 << '\n';
    return 0;
  }
  VI ans(n, -1);
  dsu d2(2 * n);
  VI col(2 * n, -1);
  for(const auto& g: d.groups()) {
    if (ans[g[0] / 2] != -1) continue;
    for(int i: g) {
      int p = i / 2, v = i % 2;
      if (v) rep(a, 2) for(auto [q, b]: cs2[2 * p + a]) d2.merge(2 * p + a, 2 * q + b);
    }
    bool ok = true;
    for(int i: g) {
      i /= 2;
      if (d2.same(2 * i, 2 * i + 1)) ok = false;
    }
    if (!ok) {
      for(int i: g) {
        i /= 2;
        d2.parent_or_size[2 * i] = d2.parent_or_size[2 * i + 1] = -1;
      }
    } else {
      for(int i: g) {
        int p = i / 2, v = i % 2;
        if (v == 0) ans[p] = 0;
        else {
          int lp = d2.leader(i);
          if (col[lp] == -1) {
            col[lp] = 0;
            int i2 = i ^ 1;
            int lp2 = d2.leader(i2);
            col[lp2] = 1;
          }
          ans[p] = col[lp] + 1;
        }
      }
    }
  }
  cout << endl;
  if(auto it = find(all(ans), -1); it != ans.end()) {
    cout << -1 << '\n';
  } else {
    rep(i, n) cout << ans[i] + 1 << " \n"[i + 1 == n];
  }
}