#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

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

int tim, dfn[N], low[N];
bool vis[N];
int tp, st[N];
int cnt, id[N];

void tarjan(int u)
{
	dfn[u] = low[u] = ++tim;
	vis[u] = 1;
	st[++tp] = u;
	for(auto v : G[u])
	{
		if(!dfn[v]) tarjan(v), low[u] = min(low[u], dfn[v]);
		else if(vis[v]) low[u] = min(low[u], dfn[v]);
	}
	if(dfn[u] == low[u])
	{
		int x; cnt++;
		do {x = st[tp--], vis[x] = 0, id[x] = cnt;}
		while(x != u);
	}
	return;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);

	cin >> n >> m;
	for(int i = 1; i <= m; i++)
	{
		int x, a, y, b; cin >> x >> a >> y >> b;
		if(a && b) G[x].push_back(y + n), G[y].push_back(x + n);
		if(a && !b) G[x].push_back(y), G[y + n].push_back(x + n);
		if(!a && b) G[x + n].push_back(y + n), G[y].push_back(x);
		if(!a && !b) G[x + n].push_back(y), G[y + n].push_back(x);
	}

	for(int i = 1; i <= n << 1; i++) if(!dfn[i]) tarjan(i);
	for(int i = 1; i <= n; i++)
		if(id[i] == id[n + i]) return cout << "No\n", 0;
	cout << "Yes\n";
	for(int i = 1; i <= n; i++)
		cout << (id[i] > id[n + i]) << " \n"[i == n];
	return 0;
}