#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int N=2e6+5;
int n,m,k;
vector<int>vals[N],id[N];
vector<int>G[N];
struct E{int i,j,k,x;};
vector<E>edges;

#define tr(x) (2*x)
#define fs(x) (2*x+1)
void adde(int x,int y){// x => y
	G[x].emplace_back(y);
	G[y^1].emplace_back(x^1);
}
bool mark[N];
vector<int>S;
bool dfs(int u){
	if(mark[u])return true;
	if(mark[u^1])return false;
	mark[u]=1;S.emplace_back(u);
	for(int v:G[u])if(!dfs(v))return false;
	return true;
}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.txt","r",stdin);
#endif

	n=read(),m=read();
	for(int _=1;_<=m;_++){
		int i=read(),j=read(),k=read(),x=read();
		edges.emplace_back((E){i,j,k,x}),edges.emplace_back((E){i,j,k,x});
		vals[i].emplace_back(x),vals[j].emplace_back(x),vals[k].emplace_back(x);
		vals[i].emplace_back(x-1),vals[j].emplace_back(x-1),vals[k].emplace_back(x-1);
	}
	int V=1e9;
	for(int i=1;i<=n;i++)vals[i].emplace_back(0),vals[i].emplace_back(V);
	int ncnt=0;
	for(int i=1;i<=n;i++){
		sort(vals[i].begin(),vals[i].end());
		vals[i].resize(unique(vals[i].begin(),vals[i].end())-vals[i].begin());
		id[i].resize(vals[i].size());
		for(int j=0;j<vals[i].size();j++)id[i][j]=ncnt++;
		for(int j=0;j+1<vals[i].size();j++)adde(tr(id[i][j]),tr(id[i][j+1]));
		adde(tr(id[i][0]),fs(id[i][0])),adde(fs(id[i].back()),tr(id[i].back()));
	}
	auto get_id=[&](int i,int v){
		int p=lower_bound(vals[i].begin(),vals[i].end(),v)-vals[i].begin();
		return id[i][p];
	};
	for(auto [i,j,k,x]:edges){
		int pi=get_id(i,x-1),qi=get_id(i,x);
		int pj=get_id(j,x-1),qj=get_id(j,x);
		int pk=get_id(k,x-1),qk=get_id(k,x);

		adde(tr(pi),fs(pj)),adde(tr(pi),fs(pk));
		adde(tr(pj),fs(pi)),adde(tr(pj),fs(pk));
		adde(tr(pk),fs(pi)),adde(tr(pk),fs(pj));

		adde(fs(qi),tr(qj)),adde(fs(qi),tr(qk));
		adde(fs(qj),tr(qi)),adde(fs(qj),tr(qk));
		adde(fs(qk),tr(qi)),adde(fs(qk),tr(qj));
	}

	for(int i=0;i<2*ncnt;i+=2){
		if(mark[i]||mark[i^1])continue;
		S.clear();
		if(!dfs(i)){
			for(int y:S)mark[y]=0;S.clear();
			if(!dfs(i+1))return puts("NO"),0;
		}
	}

	puts("YES");

	ll ans=0;
	for(int i=1;i<=n;i++){
		for(int j=0;j<id[i].size();j++){
			if(mark[tr(id[i][j])]){cout<<vals[i][j]<<" ";break;}
		}
	}
	puts("");

	return 0;
}