#include <bits/stdc++.h>

#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = 2e5 + 5;

std::vector<int> G[MAXN];
int dfn[MAXN],low[MAXN],st[MAXN],tp,tot,bel[MAXN];
bool ins[MAXN];

inline void dfs(int v){
    static int ts = 0;dfn[v] = low[v] = ++ts;ins[v] = 1;st[++tp] = v;
    for(auto x:G[v]){
        if(!dfn[x]){
            dfs(x);
            low[v] = std::min(low[v],low[x]);
        }
        else if(ins[x]) low[v] = std::min(low[v],dfn[x]);
    }
    if(low[v] == dfn[v]){
        int t = -1;++tot;
        do{
            t = st[tp--];
            bel[t] = tot;
            ins[t] = 0;
        }while(t != v);
    }
}

int n,m;

inline int get(int a,int b){
    return a+b*n;
}

int main(){
    scanf("%d%d",&n,&m);
    FOR(i,1,m){
        int a,b,c,d;scanf("%d%d%d%d",&a,&b,&c,&d);
        G[get(a,!b)].pb(get(c,d));
        G[get(c,!d)].pb(get(a,b));
    }
    FOR(i,1,2*n) if(!dfn[i]) dfs(i);
    FOR(i,1,n) if(bel[i] == bel[i+n]) return puts("No"),0;
    puts("Yes");
    FOR(i,1,n) printf("%d ",bel[i] > bel[i+n]);puts("");
    return 0;
}