// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <random>
#include <iomanip>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;

#define PB emplace_back
// #define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 2e5;
int a, b, top, dfn[N + 5], low[N + 5], tot, sk[N + 5], scc, bel[N + 5], R;
bool vis[N + 5];
struct node {
	int x, y, z, w;
} t[N + 5];
vi s[N + 5], st[N + 5], id[N + 5];

void dfs(int n) {
	dfn[n] = low[n] = ++tot;
	sk[++R] = n, vis[n] = 1;
	for(int v : st[n]) {
		if(!dfn[v]) dfs(v), low[n] = min(low[n], low[v]);
		else if(vis[v]) low[n] = min(low[n], dfn[v]);
	}
	if(dfn[n] != low[n]) return;
	int m = -1;
	++scc;
	while(m != n) {
		m = sk[R--];
		vis[m] = 0;
		bel[m] = scc;
	}
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a >> b;
	int x, y, z, w;
	rep(i, 1, b) {
		cin >> x >> y >> z >> w;
		t[i] = node {x, y, z, w};
		s[x].PB(w), s[y].PB(w), s[z].PB(w);
	}
	auto d = [&] (int i, int x, int y) {
		// cerr << siz(id[i]) << ' ' << x << endl;
		assert(x < siz(id[i]));
		return y * top + id[i][x];
	};
	rep(i, 1, a) {
		sort(s[i].begin(), s[i].end());
		s[i].erase(unique(s[i].begin(), s[i].end()), s[i].end());
		id[i].resize(siz(s[i]));
		for(int &x : id[i]) x = ++top;
	}
	rep(i, 1, a) {
		rep(j, 0, siz(id[i]) - 2) st[d(i, j, 0)].PB(d(i, j + 1, 0));
		rep(j, 1, siz(id[i]) - 1) st[d(i, j, 1)].PB(d(i, j - 1, 1));
	}
	rep(i, 1, b) {
		int p[3], q[3], w;
		p[0] = t[i].x, p[1] = t[i].y, p[2] = t[i].z, w = t[i].w;
		rep(j, 0, 2) q[j] = lower_bound(s[p[j]].begin(), s[p[j]].end(), w) - s[p[j]].begin();
		rep(j, 0, 2) {
			if(q[j]) {
				if(q[(j + 1) % 3]) st[d(p[j], q[j] - 1, 0)].PB(d(p[(j + 1) % 3], q[(j + 1) % 3] - 1, 1));
				if(q[(j + 2) % 3]) st[d(p[j], q[j] - 1, 0)].PB(d(p[(j + 2) % 3], q[(j + 2) % 3] - 1, 1));
			}
			st[d(p[j], q[j], 1)].PB(d(p[(j + 1) % 3], q[(j + 1) % 3], 0));
			st[d(p[j], q[j], 1)].PB(d(p[(j + 2) % 3], q[(j + 2) % 3], 0));
		}
		// return 0;
	}
	rep(i, 1, top + top) if(!dfn[i]) dfs(i);
	rep(i, 1, top) if(bel[i] == bel[i + top]) return cout << "NO", 0;
	cout << "YES\n";
	rep(i, 1, a) {
		if(!siz(s[i])) {
			cout << "1000000000 ";
			continue;
		}
		rep(j, 0, siz(s[i]) - 1) if(bel[id[i][j]] < bel[id[i][j] + top]) {
			cout << s[i][j] << ' ';
			break;
		}
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}