// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#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> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& 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 << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 1e6 + 10;
int n, m, dfn[N], low[N], sta[N], sccnum[N], stacnt, dfscnt, scccnt;
vector <int> v[N];
void tarjan(int x) {
	low[x] = dfn[x] = ++dfscnt;
	sta[stacnt++] = x;
	for (int i: v[x])
		if (!dfn[i]) {
			tarjan(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 a, b, c, d;
		read(a), read(b), read(c), read(d);
		v[a + (b ^ 1) * n].push_back(c + d * n);
		v[c + (d ^ 1) * n].push_back(a + b * n);
	}
	F(i, 1, n * 2)
		if (!dfn[i]) tarjan(i);
	F(i, 1, n)
		if (sccnum[i] == sccnum[i + n]) {
			puts("No");
			return 0;
		}
	puts("Yes");
	F(i, 1, n) cout << (sccnum[i] > sccnum[i + n]) << ' ';
	return 0;
}
/* why?
*/