#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int M = N * 6;

inline int read() {
	char ch = getchar(); int x = 0;
	while (!isdigit(ch)) {ch = getchar();}
	while (isdigit(ch)) {x = (x << 3) + (x << 1) + ch - 48; ch = getchar();}
	return x;
}

struct node {
	int x, y, z, v;
}q[N];
int n, T, tot, a[N], dfn[M], low[M], num, cnt, col[M], ed[N], st[N];
map< pair<int, int>, int > mp;
bitset<M> instack;
vector<int> g[M];
set<int> S[N];
stack<int> s;

void tarjan(int x) {
	dfn[x] = low[x] = ++num;
	s.push(x); instack[x] = 1;
	for (auto y : g[x]) {
		if (!dfn[y]) {
			tarjan(y);
			low[x] = min(low[x], low[y]);
		}
		else if (instack[y]) low[x] = min(low[x], dfn[y]);
	}
	if (dfn[x] == low[x]) {
		int k; cnt++;
		do {
			k = s.top(); s.pop();
			instack[k] = 0; col[k] = cnt;
		}while (k != x);
	}
}

int main() {
	n = read(); T = read();
	for (int i = 1; i <= T; ++i) {
		q[i].x = read(); q[i].y = read(); q[i].z = read(); q[i].v = read();
		S[q[i].x].insert(q[i].v); S[q[i].y].insert(q[i].v); S[q[i].z].insert(q[i].v);
	}
	for (int i = 1; i <= n; ++i) {
		st[i] = tot + 1;
		for (auto j : S[i]) mp[make_pair(i, j)] = ++tot;
		ed[i] = tot;
	}
	for (int i = 1; i <= n; ++i)
		for (int j = st[i]; j < ed[i]; ++j)
			g[j].push_back(j + 1), g[j + 1 + tot].push_back(j + tot);
	for (int i = 1, x, y, z; i <= T; ++i) {
		x = mp[make_pair(q[i].x, q[i].v)];
		y = mp[make_pair(q[i].y, q[i].v)];
		z = mp[make_pair(q[i].z, q[i].v)];
		for (int j = 0; j < 3; ++j) {
			g[x].push_back(y + tot);
			g[x].push_back(z + tot);
			if (x < ed[q[i].x]) {
				if (y < ed[q[i].y]) g[x + 1 + tot].push_back(y + 1);
				if (z < ed[q[i].z]) g[x + 1 + tot].push_back(z + 1);
			}
			swap(q[i].x, q[i].z); swap(q[i].x, q[i].y);
			swap(x, z); swap(x, y);
		}
	}
	for (int i = 1; i <= (tot << 1); ++i)
		if (!dfn[i]) tarjan(i);
	for (int i = 1; i <= n; ++i)
		for (int j = st[i]; j <= ed[i]; ++j)
			if (col[j] == col[j + tot]) return puts("NO"), 0;
	puts("YES");
	for (int i = 1; i <= n; ++i) {
		auto it = S[i].begin();
		int res = 1, now = st[i];
		while (now <= ed[i]) {
			if (col[now] > col[now + tot]) res = (*it);
			it++; now++;
		}
		printf("%d ", res);
	}
	return 0;
}