#include <bits/stdc++.h>
#define N 300005
#define pb push_back
using namespace std;

int n, m, c[N], ans[N];
int a[N][3], val[N];
vector<int> V[N], id[2][N], E[N];
int dfn[N], low[N], col[N], stk[N], in[N], tme, top, scc;

inline void adeg(int u, int v) { E[u].pb(v); }
void tarjan(int x) {
	dfn[x] = low[x] = ++tme;
	stk[++top] = x; in[x] = 1;
	for (auto y : E[x]) {
		if (!dfn[y]) tarjan(y), low[x] = min(low[x], low[y]);
		else if (in[y]) low[x] = min(low[x], dfn[y]);
	}	
	if (dfn[x] == low[x]) {
		++scc; int z = 0;
		do {
			z = stk[top--];
			col[z] = scc; in[z] = 0;
		} while (z != x);
	}
}

int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		for (int j = 0; j <= 2; j++) scanf("%d", &a[i][j]);
		scanf("%d", &val[i]);
		for (int j = 0; j <= 2; j++) V[a[i][j]].push_back(val[i]); 
	} 
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		sort(V[i].begin(),V[i].end()); 
		c[i] = V[i].size();
		for (int j = 0; j < c[i]; j++) {
			id[0][i].pb(++cnt); id[1][i].pb(++cnt);
			if (j) adeg(id[0][i][j-1],id[0][i][j]), adeg(id[1][i][j],id[1][i][j-1]);
		}
	}
	for (int i = 1; i <= m; i++) {
		for (int p:{0,1,2}) for (int q:{0,1,2}) if (p != q) {
			int u = a[i][p], v = a[i][q];
			int up = lower_bound(V[u].begin(),V[u].end(),val[i])-V[u].begin();
			int vp = lower_bound(V[v].begin(),V[v].end(),val[i])-V[v].begin();
			adeg(id[0][u][up], id[1][v][vp]);
			if (up+1<c[u] && vp+1<c[v]) adeg(id[1][u][up+1],id[0][v][vp+1]);
		}
	} 
	for (int i = 1; i <= cnt; i++) if (!dfn[i]) tarjan(i);
	for (int i = 1; i <= n; i++) {
		ans[i] = 1;
		for (int j = 0; j < c[i]; j++) {
			int u = id[0][i][j], v = id[1][i][j];
			if (col[u] == col[v]) { puts("NO"); return 0; }
			if (col[v] < col[u]) ans[i] = V[i][j];
		} 
	}
	puts("YES");
	for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
	return 0;
}