#include <bits/stdc++.h>
using namespace std;
using ll = long long;

constexpr int N = 2e5 + 5, M = 5e5 + 5;
vector<int> G[N];

int dfn[N], low[N], dn;
int stc[N], top; bool ins[N];
vector<vector<int>> scc; int col[N];
inline void form(int u) {
  vector<int> C;
  for(int x = stc[top--]; ; x = stc[top--]) {
    C.push_back(x), col[x] = scc.size();
    if(x == u) break;
  }
  scc.push_back(C);
}
inline void tarjan(int u) {
  ins[stc[++top] = u] = true;
  dfn[u] = low[u] = ++dn;
  for(auto v : G[u]) {
    if(!dfn[v]) tarjan(v), low[u] = min(low[u], low[v]);
    else if(ins[v]) low[u] = min(low[u], dfn[v]);
  }
  if(dfn[u] == low[u]) form(u);
}

int n, m;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);

  cin >> n >> m;
  for(int i = 1; i <= m; i++) {
    int a, b, c, d; cin >> a >> b >> c >> d;
    G[a + b * n].push_back(c + !d * n);
    G[c + d * n].push_back(a + !b * n);
  }
  for(int i = 1; i <= n * 2; i++) {
    if(!dfn[i]) tarjan(i);
  }
  for(int i = 1; i <= n; i++) {
    if(col[i] == col[i + n]) return cout << "No\n", 0;
  }
  cout << "Yes\n";
  for(int i = 1; i <= n; i++) {
    cout << (col[i] < col[i + n]) << " \n"[i == n];
  }
}