#include <cstdio>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <cctype>
#include <queue>
#include <cmath>
#include <map>
#include <vector>
#include <set>

namespace uvu
{
#define LOCAL _______________DONT_DEFINE_NE___________________
#define ll long long
#define inf 0x3f3f3f3f
// #define int long long
// #define inf 0x3f3f3f3f3f3f3f3fll
#define infll 0x3f3f3f3f3f3f3f3fll
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define gline debug("now is #%d\n", __LINE__)
#define pii std::pair <int, int>
#define mkp std::make_pair
#define fi first
#define se second
char _ST_;
const int BUFSIZE = (1 << 20);
char ibuf[BUFSIZE], *iS = ibuf, *iT = ibuf;
char obuf[BUFSIZE], *oS = obuf, *oT = obuf + BUFSIZE;
char getc()
{
#ifdef LOCAL
	return getchar();
#else
	if(iS == iT) iT = (iS = ibuf) + fread(ibuf, 1, BUFSIZE, stdin);
	return iS == iT ? EOF : *iS++;
#endif
#define getchar ERR
}

void Flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; }
struct flusher { ~flusher(){ Flush(); }}iamflusher;
void putc(char c)
{
#ifdef LOCAL
	putchar(c);
#else
	*oS++ = c;
	if(oS == oT) Flush();
#endif
}

template <typename T = int> T read()
{
	T x = 0, f = 1; char c = getc();
	for(; !isdigit(c); c = getc()) if(c == '-') f = -1;
	for(;  isdigit(c); c = getc()) x = (x << 3) + (x << 1) + (c ^ 48);
	return x * f;
}

template <typename T> void print(T x, char c)
{
static int sta[BUFSIZE], top;
	top = 0;
	if(x < 0) putc('-'), x = -x;
	if(!x) sta[top = 1] = 0;
	for(; x; x /= 10) sta[++top] = x % 10;
	for(; top; ) putc(sta[top--] ^ 48);
	if(c) putc(c);
}

int readstr(char *s, int base)
{
	int idx = base - 1; char c = getc();
	for(; !(isdigit(c) || isalpha(c) || c == '.' || c == '_'); c = getc());
	for(;   isdigit(c) || isalpha(c) || c == '.' || c == '_' ; c = getc()) s[++idx] = c;
	return idx - base + 1;
}

void printf(const char *s) { for(; *s; s++) putc(*s); }
template <typename T, typename ... Args>
void printf(const char *s, T x, Args ... rest)
{
	for(; *s; s++)
	{
		if(*s != '%') { putc(*s); continue; }
		s++; if(*s == 'd') print(x, 0);
		else if(*s == 'c') putc(x);
		printf(s + 1, rest ...);
		return;
	}
}

template <typename T> void ckmax(T &x, T y) { x = x > y ? x : y; }
template <typename T> void ckmin(T &x, T y) { x = x < y ? x : y; }
#define mod 998244353
// #define mod 1000000007
int sm(int x) { return x >= mod ? x - mod : x; }
void plus_(int &x, int y) { x = sm(x + y); }
void mul_(int &x, int y) { x = 1ll * x * y % mod; }
int ksm(int a, int b) { int res = 1; for(; b; b >>= 1, mul_(a, a)) if(b & 1) mul_(res, a); return res; }

#define N 1000010
int n, m;
int h[N], e[N], ne[N], idx = -1;
void add_edge(int x, int y) { ne[++idx] = h[x], h[x] = idx, e[idx] = y; }
void add(int x, int y) { add_edge(x, y), add_edge(y, x); }
int dfn[N], low[N], sta[N], top;
bool insta[N]; int scc[N], sc;
void tarjan(int k)
{
	dfn[k] = low[k] = ++dfn[0];
	insta[sta[++top] = k] = 1;
	for(int i = h[k]; ~i; i = ne[i])
	{
		int nx = e[i];
		if(!dfn[nx]) { tarjan(nx); ckmin(low[k], low[nx]); }
		else if(insta[nx]) ckmin(low[k], dfn[nx]);
	}
	if(dfn[k] == low[k]) { ++sc; while(1) { int v = sta[top--]; insta[v] = 0; scc[v] = sc; if(v == k) break; } }
}

void solve()
{
	memset(h, idx = -1, sizeof(h));
	n = read(), m = read();
	for(int i = 1, a, x, b, y; i <= m; i++)
	{
		a = read(), x = read(), b = read(), y = read();
		add_edge(a + (x ^ 1) * n, b + y * n);
		add_edge(b + (y ^ 1) * n, a + x * n);
	}
	for(int i = 1; i <= n + n; i++) if(!dfn[i]) tarjan(i);
	for(int i = 1; i <= n; i++) if(dfn[i] == dfn[i + n]) { printf("No\n"); return; }
	printf("Yes\n");
	for(int i = 1; i <= n; i++) printf("%d ", scc[i] > scc[i + n]);
	putc('\n');
}

void init()
{

}

char _ED_;
void mian()
{
	debug("%.3f MB\n", abs(&_ST_ - &_ED_) / 1024.0 / 1024);
	init();
	for(int T = 1; T; T--, solve());
}

#ifdef int
	#undef int
#endif
}

int main()
{
	// freopen("tmp.in", "r", stdin);
	// freopen("tmp.out", "w", stdout);
	uvu::mian(); return 0;
}