#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=1e5+10,M=5e5+10,V=N*2;
int n,m;
vector<int>to[N+N];
void add(int u,int v){
	to[u].push_back(v);
}
int dft,sct,dfn[N],low[N],scc[N];
void tarjan(int u){
	static int top,stk[N];
	dfn[u]=low[u]=++dft,stk[++top]=u;
	for(int v:to[u]){
		if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
		else if(!scc[v])low[u]=min(low[u],dfn[v]);
	}
	if(dfn[u]==low[u]){
		sct++;
		do scc[stk[top]]=sct;while(stk[top--]^u);
	}
}
int main(){
	scanf("%d%d",&n,&m);
	for(int u,x,v,y;m--;){
		scanf("%d%d%d%d",&u,&x,&v,&y);
		add(u+!x*n,v+y*n),add(v+!y*n,u+x*n);
	}
	for(int i=1;i<=n+n;i++)if(!dfn[i])tarjan(i);
	for(int i=1;i<=n;i++){
		if(scc[i]==scc[i+n])puts("No"),exit(0);
	}
	puts("Yes");
	for(int i=1;i<=n;i++){
		printf("%d%c",scc[i+n]<scc[i],"\n "[i<n]);
	}
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif