#include <bits/stdc++.h>
#define pb push_back

using namespace std;
const int N = 2e5+5; 
int n, m, a[N], b[N], c[N], d[N], p[4], dfn[N*4], low[N*4], sid[N*4], sc, dt, stk[N*4], ed, istk[N*4], mk[N*4]; 
vector <int> v[N], e[N*4]; 
map <int, int> id[N]; 

void tarjan (int p) {
	dfn[p] = low[p] = ++dt; 
	istk[p] = 1; stk[++ed] = p; 
	for (int i : e[p]) {
		if (!dfn[i]) {
			tarjan(i); low[p] = min(low[p], low[i]); 
		}
		else if (istk[i]) low[p] = min(low[p], dfn[i]); 
	}
	if (dfn[p] == low[p]) {
		int x; ++sc; 
		do {
			x = stk[ed--]; istk[x] = 0; 
			sid[x] = sc; 
		} while (x^p);
	}
}

int main () {
	cin >> n >> m; 
	for (int i = 1;i <= m;i++) {
		int x, y, z, k; 
		cin >> x >> y >> z >> k; 
		a[i] = x; b[i] = y; c[i] = z; d[i] = k; 
		v[x].pb(k); v[y].pb(k); v[z].pb(k); 
	}
	int S = 0; 
	for (int i = 1;i <= n;i++) v[i].pb(0), v[i].pb(1e9+1); 
	for (int i = 1;i <= n;i++) {
		sort(v[i].begin(), v[i].end()); 
		v[i].resize(unique(v[i].begin(), v[i].end())-v[i].begin()); 
		for (int j : v[i]) id[i][j] = ++S; //, cout << i << " " << j << " " << S << endl; 
	} 
//	cout << endl; 
	for (int i = 1;i <= n;i++) {
		for (int j : v[i]) {
			if (j <= 1e9) e[id[i][j]].pb(id[i][j]+1); 
		}
		for (int j : v[i]) {
			if (j > 0) e[id[i][j]+S].pb(id[i][j]+S-1); 
		}
	}
	for (int i = 1;i <= m;i++) {
		p[0] = a[i]; p[1] = b[i]; p[2] = c[i]; 
		sort(p, p+3); 
		do {
			e[id[p[0]][d[i]]-1].pb(id[p[1]][d[i]]+S); 
//			e[id[p[0]][d[i]]-1].pb(id[p[2]][d[i]]+S); 	
			e[id[p[0]][d[i]]+1+S].pb(id[p[1]][d[i]]); 
//			e[id[p[0]][d[i]]+1+S].pb(id[p[2]][d[i]]); 
//			cout << id[p[0]][d[i]]-1 << " " << id[p[1]][d[i]]+S << endl; 
//			cout << id[p[0]][d[i]]+1+S << " " << id[p[1]][d[i]] << endl; 
		} while (next_permutation(p, p+3)); 
	}
	for (int i = 1;i <= S+S;i++) if (!dfn[i]) tarjan(i); 
	for (int i = 1;i <= n;i++) {
		for (int j : v[i]) {
			if (j <= 1e9) {
				if (sid[id[i][j]] == sid[id[i][j]+1+S]) {
					cout << "NO"; return 0; 
				}
			}
		}
	}
//	for (int i = 1;i <= S*2;i++) cout << sid[i] << " "; cout << endl; 
	cout << "YES\n"; 
	for (int i = 1;i <= n;i++) {
		int k = 0; 
		for (int j : v[i]) {
			if (sid[id[i][j]+S] <= sid[id[i][j]]) {
				k = j; 
			}
//			cout << sid[id[i][j]] << " " << sid[id[i][j]+S] << endl; 
//			if (max(sid[id[i][j]], sid[id[i][j]+S]) <= max(sid[id[i][k]], sid[id[i][k]+S])) k = j; 
		}
//		cout << endl; 
		cout << max(1, min(k, (int)1e9)) << " "; 
	}
	return 0; 
}