#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i) 
#define R(i, j, k) for(int i = (j); i >= (k); --i) 
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size()) 
#define me(a, x) memset(a, x, sizeof(a)) 
#define ull unsigned long long 
using namespace std;
const int N = 1e6 + 7, inf = 1e7;
int n, m;
int ehd[N], ev[N], enx[N], eid;
void eadd(int u, int v) {
	++eid, ev[eid] = v, enx[eid] = ehd[u], ehd[u] = eid;
}

int dfn[N], low[N], idt, qid[N], cnt;

int stk[N], tp;
bool vis[N];
 
void dfs(int x) {
	dfn[x] = low[x] = ++idt, vis[x] = true, stk[++tp] = x;
	for(int i = ehd[x]; i; i = enx[i]) {
		if(!dfn[ev[i]]) dfs(ev[i]), low[x] = min(low[x], low[ev[i]]);
		else if(vis[ev[i]]) low[x] = min(low[x], dfn[ev[i]]);
	}
	if(dfn[x] == low[x]) {
		++cnt;
		for(int u = 0; u != x; --tp) 
			u = stk[tp], qid[u] = cnt, vis[u] = false;
	} 
} 

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	L(i, 1, m) {
		int a, b, c, d;
		cin >> a >> b >> c >> d, b ^= 1;
		eadd(a + b * n, c + d * n);
		eadd(c + (d ^ 1) * n, a + (b ^ 1) * n);
	}
	
	L(i, 1, n * 2) if(!dfn[i]) dfs(i);
	
	L(i, 1, n) 
		if(qid[i] == qid[i + n]) {
			cout << "No\n";
			return 0;
		}
	cout << "Yes\n";
	L(i, 1, n) 
		if(qid[i] < qid[i + n]) cout << 1 << ' ';
		else cout << 0 << ' ';
	return 0;
}