#include<bits/stdc++.h>
#define MAXN 500005
using namespace std;
int n,m;
vector<int>G[MAXN],id[MAXN];
int S[MAXN],top;
int dfsc,scct;
int dfn[MAXN],low[MAXN],sccno[MAXN];
void dfs(int x){
	dfn[x]=low[x]=++dfsc;
	S[++top]=x;
	for(auto y:G[x]){
        if(!dfn[y]){
			dfs(y);
			low[x]=min(low[x],low[y]);
		}else if(!sccno[y])low[x]=min(low[x],dfn[y]);
	}
	if(low[x]==dfn[x]){
		scct++;
		while(1){
			int y=S[top];top--;
			sccno[y]=scct;
			if(x==y)break;
		}
	} 
}
int main(){
	cin>>n>>m;
	int x,a,y,b;
	for(int i=1;m>=i;i++){
		cin>>x>>a>>y>>b;
		G[x+a*n].push_back(y+(b^1)*n);
		G[y+b*n].push_back(x+(a^1)*n);
	}
	for(int i=1;n*2>=i;i++)
		if(!dfn[i])dfs(i);
	for(int i=1;n>=i;i++)
		if(sccno[i]==sccno[i+n]){
			cout<<"No"<<endl;
			return 0;
		}
	cout<<"Yes"<<endl;
	for(int i=1;n>=i;i++)cout<<(sccno[i]>sccno[i+n])<<" ";
	cout<<endl;
	return 0;
}