#include <bits/stdc++.h>
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
const int N = 2e5 + 10;
int n, m, dfn[N], low[N], sccnum[N], scccnt, dfscnt, sta[N], stacnt;
vector <int> v[N];
void dfs(int x) {
	low[x] = dfn[x] = ++dfscnt;
	sta[stacnt++] = x;
	for (int i: v[x])
		if (!dfn[i]) {
			dfs(i);
			chkmin(low[x], low[i]);
		} else if (!sccnum[i]) {
			chkmin(low[x], dfn[i]);
		}
	if (low[x] == dfn[x]) {
		scccnt++;
		do {
			sccnum[sta[--stacnt]] = scccnt;
		} while (sta[stacnt] != x);
	}
}
signed main() {
	read(n); read(m);
	F(i, 1, m) {
		int x, y, a, b; read(x); read(a); read(y); read(b);
		v[x + (a ^ 1) * n].push_back(y + b * n);
		v[y + (b ^ 1) * n].push_back(x + a * n);
	}
	F(i, 1, 2 * n)
		if (!dfn[i]) dfs(i);
	F(i, 1, n)
		if (sccnum[i] == sccnum[i + n]) return puts("No"), 0;
	puts("Yes");
	F(i, 1, n) cout << (sccnum[i] < sccnum[i + n]) << " ";
	return 0;
}