#include<bits/stdc++.h>
using namespace std;
//   #define int long long
#define F(i, l, r) for(int i = (l); i <= (r); ++i)
#define dF(i, r, l) for(int i = (r); i >= (l); --i)

int ri() {
	int x = 0, f = 1;
	char c = getchar();
	while(c < '0' || c > '9') {
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' && c <= '9') {
		x = x* 10 + c - 48;
		c  = getchar();
	} return x * f;
}

const int _ = 1e6 + 5;

vector<int> d[_];

int cnt, dfn[_], low[_], Id[_], n, m;

int id(int x, int y) {
    return x + y * (n + 1);
}

void add(int u, int v) {
    d[u].push_back(v);
}

stack<int> st;

int cntn;

void tarjan(int u) {
    dfn[u] = low[u] = ++cnt;
    st.push(u);
    for(int v : d[u]) if(!dfn[v]) {
        tarjan(v);
        low[u] = min(low[u], low[v]);
    } else if(!Id[v]) low[u] = min(low[u], dfn[v]);
    if(low[u] == dfn[u]) {
        ++cntn;
        while(1) {
            int nw = st.top();
            st.pop();
            Id[nw] = cnt;
            if(nw == u) break;
        }
    }
}

signed main() {
	n = ri(), m = ri();
    F(i, 1, m) {
        int a = ri(), b = ri(), c = ri(), d = ri();
        add(id(a, !b), id(c, d));
        add(id(c, !d), id(a, b));
    }
    F(i, 1, n + n + 1) if(!dfn[i]) tarjan(i);
    F(i, 1, n) if(Id[i] == Id[i + n + 1]) {
        puts("NO");
        return 0;
    }
    puts("YES");
    F(i, 1, n) if(Id[i] < Id[i + n + 1]) {
        cout << 0 << ' ';
    } else cout << 1 << ' ';
    cout << '\n';
}