#include <bits/stdc++.h>
#define ll long long
#define pir pair <ll, ll>
#define mkp make_pair
#define fi first
#define se second
#define pb push_back
using namespace std;
const ll maxn = 1e5 + 10;
ll n, m, a, b, c, d;
ll scc[maxn], cnt, dfn[maxn], low[maxn], ti, stk[maxn], top, vis[maxn];
vector <ll> to[maxn];
void tarjan(ll u) {
	dfn[u] = low[u] = ++ti, vis[stk[++top] = u] = 1;
	for(ll v: to[u])
		if(dfn[v]) {
			if(vis[v]) low[u] = min(low[u], dfn[v]);
		} else {
			tarjan(v); low[u] = min(low[u], low[v]);
		}
	if(dfn[u] == low[u]) {
		++cnt, stk[top + 1] = 0;
		while(stk[top + 1] ^ u) {
			ll x = stk[top--]; vis[x] = 0;
			scc[x] = cnt;
		}
	}
}
int main(){
	scanf("%lld%lld", &n, &m);
	for(ll i = 1; i <= m; i++) {
		scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
		to[a + (b ^ 1) * n].pb(c + d * n);
		to[c + (d ^ 1) * n].pb(a + b * n);
	}
	for(ll i = 1; i <= 2 * n; i++)
		if(!dfn[i]) tarjan(i);
	for(ll i = 1; i <= n; i++)
		if(scc[i] == scc[i + n]) { puts("No"); return 0; }
	puts("Yes");
	for(ll i = 1; i <= n; i++)
		printf("%lld ", (ll) (scc[i] > scc[i + n]));
	return 0;
}