#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>

using namespace std;

const int N = 1e5 + 20;
const int Ding = 88281;

int n, m, a[N];
struct Infor
{
	int i, j, k, x;
	void init(){scanf("%d%d%d%d", &i, &j, &k, &x);}
}I[N];

int max3(int a, int b, int c) {return max(max(a, b), c);}
int min3(int a, int b, int c) {return min(min(a, b), c);}

namespace sub1
{
	const int N1 = 12;
	int p[N1], rk[N1], seq[N1];
	void solve()
	{
		for(int i = 1; i <= n; i ++) p[i] = i;
		do
		{
			for(int i = 1; i <= n; i ++) seq[i] = 0;
			bool ex = 1;
			for(int tp = 1, i, j, k; tp <= m; tp ++)
			{
				i = I[tp].i; j = I[tp].j; k = I[tp].k;
				if(p[i] > p[j]) swap(i, j);
				if(p[i] > p[k]) swap(i, k);
				if(p[j] > p[k]) swap(j, k);
				// printf("(%d, %d, %d)\n", i, j, k);
				if(seq[j] && seq[j] != I[tp].x) {ex = 0; break;}
				seq[j] = I[tp].x;
			}
			for(int i = 1; i <= n; i ++)
				if(!seq[i]) seq[i] = (seq[p[i - 1]] ? seq[p[i - 1]] : 1);
			for(int tp = 1, i, j, k; tp <= m; tp ++)
			{
				i = I[tp].i; j = I[tp].j; k = I[tp].k;
				if(seq[i] + seq[j] + seq[k] - max3(seq[i], seq[j], seq[k]) - min3(seq[i], seq[j], seq[k]) != I[tp].x)
					{ex = 0; break;}
			}
			if(ex)
			{
				puts("YES");
				for(int i = 1; i <= n; i ++) printf("%d ", seq[i]);
				return ;
			}
		}while(next_permutation(p + 1, p + n + 1));
		puts("NO");
	}
}

int main()
{
	// freopen("C.in", "r", stdin);
	// freopen("C.out", "w", stdout);
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; i ++) I[i].init();
	if(n <= 10 && m <= 10) {sub1::solve(); return 0;}
}