#include <bits/stdc++.h>

const int N = 2e5 + 10, M = 1e6 + 10;

inline int read()
{
	int x = 0, f = 0; char ch = getchar();
	while (!isdigit(ch)) f |= ch == '-', ch = getchar();
	while ( isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f ? -x : x;
}

int tot = 1, fir[N], nex[M], got[M];

inline void add(int u, int v)
{
	nex[++tot] = fir[u], fir[u] = tot, got[tot] = v;
	// nex[++tot] = fir[v], fir[v] = tot, got[tot] = u;
}

int idx = 0, dfn[N], low[N];
int top = 0, stk[N], ins[N];
int num = 0, col[N];

inline void dfs(int u)
{
	dfn[u] = low[u] = ++idx, ins[stk[++top] = u] = 1;
	for (int i = fir[u]; i; i = nex[i])
		if (!dfn[got[i]]) dfs(got[i]), low[u] = std::min(low[u], low[got[i]]);
		else if (ins[got[i]]) low[u] = std::min(low[u], dfn[got[i]]);
	if (dfn[u] == low[u])
	{
		++num;
		do
		{
			ins[stk[top]] = 0;
			col[stk[top]] = num;
		} while (stk[top--] != u);
	}
}

int main()
{
	int n = read(), m = read();
	for (int i = 1; i <= m; ++i)
	{
		int u = read(), a = read();
		int v = read(), b = read();
		add(u + (a ^ 1) * n, v + b * n);
		add(v + (b ^ 1) * n, u + a * n);
	}
	for (int i = 1; i <= 2 * n; ++i) if (!dfn[i]) dfs(i);
	for (int i = 1; i <= n; ++i) if (col[i] == col[i + n]) return puts("No"), 0;
	puts("Yes");
	for (int i = 1; i <= n; ++i) printf("%d ", col[i] > col[i + n]);
	return 0;
}