#include <bits/stdc++.h>
using namespace std;
using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n)  for(int i=0;i<(n);++i)
#define sizc(x) ((int)x.size())
#define allc(x) x.begin(),x.end()
#define fir first
#define sec second
namespace KnownError_{
    constexpr int N = 1e5+5;
    int n,m,s,t;
    vector<int> G[N],Gi[N];
    void add(int u,int v){
        G[u].push_back(v);
        Gi[v].push_back(u);
    }
    bool vis[N<<1];
    int a[N<<1],cnt,idx,bel[N<<1];
    void dfs1(int u){
        vis[u]=1;
        for(auto v:G[u])if(!vis[v])dfs1(v);
        a[++cnt]=u;
    }
    void dfs2(int u){
        bel[u]=idx;
        vis[u]=1;
        for(auto v:Gi[u])if(!vis[v])dfs2(v);
    }
    void main(){
        cin>>n>>m;
        repn(_,m){
            int a,b,c,d;
            cin>>a>>b>>c>>d;
            add(a+(!b)*n,c+d*n);
            add(c+(!d)*n,a+b*n);
        }
        rep(i,1,n<<1)if(!vis[i])dfs1(i);
        fill(vis+1,vis+(n<<1)+1,0);
        per(i,n<<1,1)if(!vis[a[i]])++idx,dfs2(a[i]);
        rep(i,1,n)if(bel[i]==bel[i+n]){
            cout<<"No\n";
            return;
        }
        cout<<"Yes\n";
        rep(i,1,n)
            if(bel[i]>bel[i+n])cout<<"0 ";
            else cout<<"1 ";
        cout<<'\n';
    }
}
signed main(){
    #ifndef ONLINE_JUDGE
    freopen("sample.in","r",stdin);
    freopen("sample.out","w",stdout);
    #endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    KnownError_::main();
}