#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
inline int read() {
    int x = 0; bool op = 0;
    char c = getchar();
    while(!isdigit(c))op |= (c == '-'), c = getchar();
    while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return op ? -x : x;
}
const int N = 2e5 + 10;
int n, m, tot, cnt, c_scc, top;
int id[N][2], dfn[N], low[N], scc[N], on[N], stk[N];
vector<int> G[N];
void tarjan(int u) {
    dfn[u] = low[u] = ++cnt; on[u] = true; stk[++top] = u;
    for(int v : G[u]) {
        if(dfn[v] == 0) {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        }
        else if(on[v])low[u] = min(low[u], dfn[v]);
    }
    if(dfn[u] == low[u]) {
        c_scc++;
        do {
            int cur = stk[top];
            scc[cur] = c_scc; on[cur] = false;
        }while(stk[top--] != u);
    }
    return ;
}
int main() { 
    n = read(); m = read();
    for(int i = 1; i <= n; i++)
        for(int o = 0; o < 2; o++)
            id[i][o] = ++tot;
    for(int i = 1; i <= n; i++) {
        int a = read(), b = read(), c = read(), d = read();
        G[id[a][!b]].pb(id[c][d]);
        G[id[c][!d]].pb(id[a][b]);
    }
    for(int i = 1; i <= n; i++)if(dfn[i] == 0)tarjan(i);
    for(int i = 1; i <= n; i++)
        if(scc[id[i][0]] == scc[id[i][1]])
            return puts("No"), 0;
    puts("Yes");
    for(int i = 1; i <= n; i++)printf("%d ", (scc[id[i][1]] < scc[id[i][0]]));
    return 0;
}