#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;

int n,m;
vector <int> G[N];

int dfn[N],low[N],id;
stack <int> st;
bool vis[N];
int col[N],cid;

void tarjan(int u){
	dfn[u]=low[u]=++id;
	st.push(u);
	vis[u]=1;
	for(int v: G[u]){
		if(!dfn[v]){
			tarjan(v);
			low[u]=min(low[u],low[v]);
		}
		else if(vis[v]) low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u]){
		cid++;
		while(1){
			int x=st.top(); st.pop();
			col[x]=cid;
			vis[x]=0;
			if(x==u) break;
		}
		
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		G[a+(b^1)*n].push_back(c+d*n);
		G[c+(d^1)*n].push_back(a+b*n);
	}
	for(int i=1;i<=n*2;i++)
		if(!dfn[i]) tarjan(i);
	for(int i=1;i<=n;i++)
		if(col[i]==col[i+n]) return cout<<"No",0;
	cout<<"Yes\n";
	for(int i=1;i<=n;i++)
		cout<<(col[i]>col[i+n])<<" ";
}