#include<bits/stdc++.h>
using namespace std;
#define id(i,j,k) (i+1+sz[j]+k*500000)
int n,m,tot,cnt,top,a[100001][3],b[100001],w[100001],sz[100001],dfn[1000001],low[1000001],ins[1000001],scc[1000001],stk[1000001];
basic_string <int> s[100001],G[1000001];
void tarjan(int u){
	low[u]=dfn[u]=++tot,ins[u]=1,stk[++top]=u;
	for(int v:G[u]){
		if(!dfn[v]) tarjan(v),low[u]=min(low[u],low[v]);
		else if(ins[v]) low[u]=min(low[u],dfn[v]);
	}
	if(dfn[u]==low[u]){
		while(stk[top]!=u) scc[stk[top]]=cnt,ins[stk[top--]]=0;
		scc[u]=cnt++,ins[u]=0,top--;
	}
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) s[i]+=1,s[i]+=1e9;
	for(int i=1;i<=m;i++){
		scanf("%d%d%d%d",&a[i][0],&a[i][1],&a[i][2],&w[i]);
		for(int j:{0,1,2}) s[a[i][j]]+=w[i];
	}
	for(int i=1;i<=n;i++){
		sort(begin(s[i]),end(s[i]));
		s[i].erase(unique(begin(s[i]),end(s[i])),end(s[i]));
		sz[i]=sz[i-1]+s[i-1].size();
		for(int j=0;j<s[i].size()-1;j++) G[id(j,i,0)]+=id(j+1,i,0),G[id(j+1,i,1)]+=id(j,i,1);
	}
	for(int i=1;i<=m;i++){
		for(int j:{0,1,2}){
			for(int k:{0,1,2}){
				if(j==k) continue;
				int u=lower_bound(s[a[i][j]].begin(),s[a[i][j]].end(),w[i])-s[a[i][j]].begin(),v=lower_bound(s[a[i][k]].begin(),s[a[i][k]].end(),w[i])-s[a[i][k]].begin();
				G[id(u,a[i][j],0)]+=id(v,a[i][k],1);
				if(u+1<s[a[i][j]].size()&&v+1<s[a[i][k]].size()) G[id(u+1,a[i][j],1)]+=id(v+1,a[i][k],0);
			}
		}
	}
	for(int i=1;i<=1000000;i++) if(!dfn[i]) tarjan(i);
	for(int i=1;i<=n;i++){
		for(int j=0;j<s[i].size();j++) if(scc[id(j,i,0)]==scc[id(j,i,1)]) return printf("NO"),0;
		for(int j=s[i].size()-1;j>=0;j--) if(scc[id(j,i,1)]>scc[id(j,i,0)]) b[i]=s[i][j];
	}
	printf("YES\n");
	for(int i=1;i<=n;i++) printf("%d ",b[i]);
	return 0;
}