#include <bits/stdc++.h>
using namespace std;
int n, m, tot = 0, dfx = 0, sct = 0, tp = 0, hd[200010], e[1000010][2], dfn[200010], low[200010], scc[200010], st[200010], a[200010];
bool bk[200010];
void add(int u,int v){e[++tot][0]=hd[u];e[tot][1]=v;hd[u]=tot;}
void dfs(int u){
	dfn[u] = low[u] = ++dfx; st[++tp] = u; bk[u] = true;
	int i, v;
	for(i = hd[u]; i > 0; i = e[i][0]){
		v = e[i][1];
		if(dfn[v] == 0){
			dfs(v);
			low[u] = min(low[u], low[v]);
		}else if(bk[v]) low[u] = min(low[u], dfn[v]);
	}
	if(low[u] >= dfn[u]){
		sct++;
		while(1){
			v = st[tp--];
			scc[v] = sct; bk[v] = false;
			if(v == u) break;
		}
	}
}
int main()
{
	int i, u, v, x, y;
	scanf("%d%d", &n, &m);
	for(i = 1; i <= n << 1; i++) hd[i] = 0, dfn[i] = 0, bk[i] = false;
	for(i = 1; i <= m; i++){
		scanf("%d%d%d%d", &u, &x, &v, &y);
		add(u + (x ? n : 0), v + (y ? 0 : n));
		add(v + (y ? n : 0), u + (x ? 0 : n));
	}
	for(i = 1; i <= n; i++){
		if(dfn[u] == 0) dfs(u);
	}
	for(i = 1; i <= n; i++){
		if(scc[i] == scc[i + n]){ printf("No"); return 0; }
		a[i] = (scc[i] < scc[i + n] ? 1 : 0);
	}
	printf("Yes\n");
	for(i = 1; i <= n; i++) printf("%d ", a[i]);
	return 0;
}