#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define fi first
#define se second
#define pb push_back
#define mst(f, i) memset(f, i, sizeof f)
#define multitest() int T; read(T); for(int tCase = 1; tCase <= T; ++tCase)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
namespace fastio{
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args &...args){
        read(t), read(args...);
    }
}
using namespace fastio;
const int N = 1e6 + 5;
int n, m;
vector<int> G[N];
int id, num, dfn[N], low[N], scc[N];
int top, st[N];
bool vis[N];
void tarjan(int u, int fa){
    dfn[u] = low[u] = ++id;
    st[++top] = u, vis[u] = 1;
    for(auto &v : G[u]){
        if(!dfn[v]){
            tarjan(v, u);
            low[u] = min(low[u], low[v]);
        }else if(vis[v]) low[u] = min(low[u], dfn[v]);
    }
    if(low[u] == dfn[u]){
        num++;
        for(int x = 0; x != u; top--){
            x = st[top], vis[x] = 0;
            scc[x] = num;
        }
    }
}
int main(){
    read(n, m);
    _rep(i, 1, m){
        int u, a, v, b; read(u, a, v, b);
        G[u + (!a) * n].pb(v + b * n);
        G[v + (!b) * n].pb(u + a * n);
    }
    _rep(i, 1, 2 * n) if(!dfn[i]) tarjan(i, 0);
    _rep(i, 1, n) if(scc[i] == scc[i + n]) return puts("No"), 0;
    puts("Yes");
    _rep(i, 1, n) printf("%d ", low[i] < low[i + n] ? 0 : 1); puts("");
    return 0;
}