#include <bits/stdc++.h>
using namespace std ;

#define ff    first
#define ss    second
#define pb    push_back

typedef long long    ll;
typedef pair<ll,ll>    ii;
typedef long double    lf;


mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll SQ = 320;
const ll N = 11;
const ll mod = 1e9 + 7;
const ll oo = 1e18;
long double eps = 1e-9;

vector <int> ans;
int n, m;

vector <vector<int>> go(vector <vector<pair<ii,int>>> ins, int ign) {
  ans.clear();
  set <int> actv;
  for (int i = 1; i <= n; ++i) actv.insert(i);
  vector <int> how(n + 1, -1);
  vector <vector<int>> hei(m + 1);
  set <ii> disp;
  vector <int> many(m + 1);
  int flag = 0;
  int tot = n;

  for (int h = n; h; --h) {
    for (auto &e : ins[h]) {
      int curl = e.ff.ff;
      int curr = e.ff.ss;
      int idx = e.ss;
      if (idx == ign) continue;
      while (1) {
        auto fn = actv.lower_bound(curl);
        if (fn == actv.end() || *fn > curr) break;
        curl = *fn;
        if (how[curl] == -1) {
          how[curl] = idx;
          many[idx]++;
          hei[idx].pb(curl);
          tot--;
        }
        else {
          actv.erase(curl);
          many[how[curl]]--;
          if (disp.count({many[how[curl]] + 1, how[curl]})) {
            disp.erase({many[how[curl]] + 1, how[curl]});
            disp.insert({many[how[curl]], how[curl]});
          }
        }
        curl++;
      }
    }

//    for (int i = 1; i <= n; ++i) cout << how[i] << ' ';
//    cout << '\n';
//    cout << "after " << h << '\n';
//    for (int j = 0; j < m; ++j) cout << many[j] << ' ';
//    cout << '\n';
//
//    cout << flag << '\n';
//    for (auto &e : disp) cout << e.ff << ' ' << e.ss << '\n';
//    cout << tot<<' ' << h-1<<'\n';
    if (!flag) {
      for (auto &e : ins[h])
        disp.insert({many[e.ss], e.ss});
    }

    if (tot < h - 1) {
      flag = 1;
      int add = h - 1 - tot;
      while (disp.size()) {
        ii fn = *disp.begin();
        if (fn.ff >= add) break;
//        cout << "erase "<<fn.ff<<' '<<fn.ss<<'\n';
        disp.erase(fn);
      }
    }
  }

  for (int i = 1; i <= n; ++i)
    if (how[i] == -1) ans.pb(i);

  if (disp.size()) hei[m].pb((*disp.begin()).ss);
  else hei[m].pb(-1);
  return hei;
}

int main(){
  #ifdef LOCAL
  freopen("input.txt","r",stdin);
  #endif // LOCAL
  ios_base::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);

  cin >> n >> m;

  vector <vector<pair<ii,int>>> ins(n + 1);

  for (int i = 0; i < m; ++i) {
    int h, s, f;
    cin >> h >> s >> f;
    ins[h].pb({{s, f},i});
  }

  vector<vector<int>> hei = go(ins, -1);

  if (hei[m][0] != -1) {
    cout << "YES\n";

//    cout << hei[m][0] << endl;
    hei = go(ins, hei[m][0]);

    vector <int> pos(n + 1);

    for (int i = 1; i <= n; ++i) {
//      cout << ans.size() << ' ' << ans.back() << endl;
      pos[ans.back()] = i; ans.pop_back();
      if (i + 1 <= n) {
        for (auto &e : ins[i + 1]) {
          for (auto &tt : hei[e.ss]) {
            ans.pb(tt);
          }
        }
      }
    }
    for (int i = 1; i <= n; ++i) cout<<pos[i] << ' ';
    cout << '\n';
  }
  else {
    cout << "NO\n";
  }
  return 0;
}