#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
const int mod = (1e9) + 7, mod2 = 998244353;
const long double eps = 1e-20;
const int siz = 2e5 + 5, siz2 = 1e7 + 2, lg = 20, block = 317, block2 = 1000,
          mxv = 5e5;
int n, m, srtd[1005];
vector<int> lr[2][1005], curls;
bool valid[1005];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int t, l, r;
    scanf("%d%d%d", &t, &l, &r);
    if (t == 1) {
      srtd[l + 1]++;
      srtd[r + 1]--;
    } else {
      lr[0][l].push_back(i);
      lr[1][r].push_back(i);
    }
  }
  for (int j = 1; j <= n; j++) {
    srtd[j] += srtd[j - 1];
    if (j > 1 && srtd[j] == 0) {
      for (int l : curls) {
        valid[l] = 1;
      }
      curls.clear();
    }
    for (int l : lr[0][j]) {
      curls.push_back(l);
    }
    for (int r : lr[1][j]) {
      if (!valid[r]) {
        printf("no\n");
        return 0;
      }
    }
  }
  printf("yes\n");
  int cur = 1000;
  printf("%d ", cur);
  for (int i = 2; i <= n; i++) {
    if (srtd[i]) {
      cur++;
    } else {
      cur--;
    }
    printf("%d ", cur);
  }
  printf("\n");
  return 0;
}
