#include <bits/stdc++.h>
using namespace std;
long long int fast_expo(long long int x, long long int p) {
  if (p == 0)
    return 1;
  else if (p % 2 == 0) {
    long long int t = fast_expo(x, p / 2) % 1000000007;
    return (t * t) % 1000000007;
  } else
    return (x * (fast_expo(x, p - 1)) % 1000000007) % 1000000007;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0 || b == 0)
    return a + b;
  else
    return gcd(b % a, a);
}
int main() {
  long long int n, s;
  cin >> n >> s;
  vector<pair<long long int, long long int>> nsor;
  long long int pre[n + 1];
  fill_n(pre, n + 1, -1);
  for (long long int i = 0; i < s; ++i) {
    long long int type;
    cin >> type;
    if (type == 1) {
      long long int l, r;
      cin >> l >> r;
      for (long long int j = l + 1; j <= r; ++j) pre[j] = 0;
    } else {
      long long int l, r;
      cin >> l >> r;
      nsor.push_back(make_pair(l, r));
    }
  }
  long long int arr[n + 1];
  arr[1] = n;
  for (long long int i = 2; i <= n; ++i) {
    arr[i] = arr[i - 1] + pre[i];
  }
  long long int flag = 0;
  for (long long int i = 0; i < nsor.size(); ++i) {
    long long int temp = 0;
    for (long long int j = nsor[i].first; j <= nsor[i].second - 1; ++j) {
      if (arr[j] > arr[j + 1]) {
        temp = 1;
        break;
      }
    }
    if (temp == 0) {
      flag = 1;
      break;
    }
  }
  if (flag == 1) {
    cout << "NO";
  } else {
    cout << "YES\n";
    for (long long int i = 1; i <= n; ++i) cout << arr[i] << " ";
  }
  return 0;
}
