#include <bits/stdc++.h>

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

constexpr int N = 2E5 + 5;

int n, m;
int p[N], scc;

std::vector<int> adj[N];

std::stack<int> st;
int dfn[N], low[N], tot;
bool vis[N];

void dfs(int x) {
	dfn[x] = low[x] = ++tot;
	vis[x] = 1; st.push(x);
	for (auto y : adj[x]) {
		if (!dfn[y]) {
			dfs(y);
			low[x] = std::min(low[x], low[y]);
		}
		if (vis[y]) {
			low[x] = std::min(low[x], dfn[y]);
		}
	}
	if (low[x] == dfn[x]) {
		++scc;
		for (int i = 0; i != x; st.pop()) {
			i = st.top();
			p[i] = scc;
			vis[i] = 0;
			if (i == x) break;
		}
	}
}

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

	//a -> a = 0, a + n -> a = 1
	//a = [p[a + n] < p[a]]

	std::cin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		int a, b, c, d;
		std::cin >> a >> b >> c >> d;
		adj[a + n * (b ^ 1)].push_back(c + n * (d & 1));
		adj[c + n * (d ^ 1)].push_back(a + n * (b & 1));
	}

	for (int i = 1; i <= 2 * n; ++i)
		if (!dfn[i]) dfs(i);

	for (int i = 1; i <= n; ++i)
		if (p[i] == p[i + n]) {
			std::cout << "No\n";
			return 0;
		}

	std::cout << "Yes\n";
	for (int i = 1; i <= n; ++i) {
		std::cout << (p[i + n] < p[i]) << " \n"[i == n];
	}

	return 0;
}