#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int med(int a, int b, int c) {
return a+b+c-max({a,b,c})-min({a,b,c});
  return (a < b)
      ? ((a < c) ? ((b < c) ? b : c) : a)
      : ((b < c) ? ((a < c) ? a : c) : b);
}

int N, M;
int U[100'010][3];
vector<int> X;


namespace brute {
vector<int> run() {
  vector<int> perm(N);
  for (int u = 0; u < N; ++u) perm[u] = u;
  do {
    vector<int> xs(N, 0);
    for (int i = 0; i < M; ++i) {
      const int p = med(perm[U[i][0]], perm[U[i][1]], perm[U[i][2]]);
      if (!xs[p]) {
        xs[p] = X[i];
      }
      if (xs[p] != X[i]) {
        goto failed;
      }
    }
    {
      int x = 1;
      for (int p = 0; p < N; ++p) {
        if (!xs[p]) {
          xs[p] = x;
        }
        if (x > xs[p]) {
          goto failed;
        }
        x = xs[p];
      }
      vector<int> ans(N, -1);
      for (int u = 0; u < N; ++u) {
        ans[u] = xs[perm[u]];
      }
      return ans;
    }
   failed:{}
  } while (next_permutation(perm.begin(), perm.end()));
  return {};
}
}  // brute


int main() {
  for (; ~scanf("%d%d", &N, &M); ) {
    X.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d%d%d", &U[i][0], &U[i][1], &U[i][2], &X[i]);
      --U[i][0];
      --U[i][1];
      --U[i][2];
    }
    
    const auto ans = brute::run();
    if (!ans.empty()) {
      puts("YES");
      for (int u = 0; u < N; ++u) {
        if (u) printf(" ");
        printf("%d", ans[u]);
      }
      puts("");
    } else {
      puts("NO");
    }
  }
  return 0;
}