#include <bits/stdc++.h>
const int N = 2e5 + 5;
int n, m, dfc, dfn[N], low[N], top, stk[N], idx, bel[N];
bool inStk[N]; std::vector<int> ver[N];
void Tarjan(int u) {
  dfn[u] = low[u] = ++dfc, stk[++top] = u, inStk[u] = true;
  for (int v: ver[u])
    if (!dfn[v]) Tarjan(v), low[u] = std::min(low[u], low[v]);
    else if (inStk[v]) low[u] = std::min(low[u], dfn[v]);
  if (low[u] == dfn[u]) {
    ++idx; int t;
    do
      t = stk[top--], inStk[t] = false, bel[t] = idx;
    while (t != u);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1, a, b, c, d; i <= m; ++i)
    scanf("%d%d%d%d", &a, &b, &c, &d),
    ver[a + (b ^ 1) * n].push_back(c + d * n),
    ver[c + (d ^ 1) * n].push_back(a + b * n);
  for (int i = 1; i <= 2 * n; ++i) if (!dfn[i]) Tarjan(i);
  for (int i = 1; i <= n; ++i)
    if (bel[i] == bel[i + n]) puts("No"), exit(0);
  puts("Yes");
  for (int i = 1; i <= n; ++i) printf("%d ", bel[i + n] > bel[i]);
  return 0;
}