Problem: Vasya has an array a_1, a_2, ..., a_n.

You don't know this array, but he told you m facts about this array. The i-th fact is a triple of numbers t_i, l_i and r_i (0 ≤ t_i ≤ 1, 1 ≤ l_i < r_i ≤ n) and it means:

  * if t_i=1 then subbarray a_{l_i}, a_{l_i + 1}, ..., a_{r_i} is sorted in non-decreasing order; 
  * if t_i=0 then subbarray a_{l_i}, a_{l_i + 1}, ..., a_{r_i} is not sorted in non-decreasing order. A subarray is not sorted if there is at least one pair of consecutive elements in this subarray such that the former is greater than the latter. 



For example if a = [2, 1, 1, 3, 2] then he could give you three facts: t_1=1, l_1=2, r_1=4 (the subarray [a_2, a_3, a_4] = [1, 1, 3] is sorted), t_2=0, l_2=4, r_2=5 (the subarray [a_4, a_5] = [3, 2] is not sorted), and t_3=0, l_3=3, r_3=5 (the subarray [a_3, a_5] = [1, 3, 2] is not sorted).

You don't know the array a. Find any array which satisfies all the given facts.

Input

The first line contains two integers n and m (2 ≤ n ≤ 1000, 1 ≤ m ≤ 1000).

Each of the next m lines contains three integers t_i, l_i and r_i (0 ≤ t_i ≤ 1, 1 ≤ l_i < r_i ≤ n).

If t_i = 1 then subbarray a_{l_i}, a_{l_i + 1}, ... , a_{r_i} is sorted. Otherwise (if t_i = 0) subbarray a_{l_i}, a_{l_i + 1}, ... , a_{r_i} is not sorted.

Output

If there is no array that satisfies these facts in only line print NO (in any letter case).

If there is a solution, print YES (in any letter case). In second line print n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — the array a, satisfying all the given facts. If there are multiple satisfying arrays you can print any of them.

Examples

Input


7 4
1 1 3
1 2 5
0 5 6
1 6 7


Output


YES
1 2 2 3 5 4 4


Input


4 2
1 1 4
0 2 3


Output


NO

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long n, m, a[1005];
pair<pair<long long, long long>, bool> p[1005];
bitset<1005> b;
bool f, g;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> p[i].second >> p[i].first.first >> p[i].first.second;
  }
  sort(p, p + m);
  for (int i = 0; i < m; i++) {
    if (p[i].second == 1) {
      b[p[i].first.first] = true;
      for (int j = p[i].first.first + 1; j <= p[i].first.second; j++) {
        if (!b[j]) {
          b[j] = true;
          a[j] = a[j - 1] + 1;
        }
      }
    } else {
      for (int j = p[i].first.first + 1; j <= p[i].first.second; j++) {
        if (!b[j]) {
          a[j] = a[j - 1] - 1;
        }
      }
    }
  }
  for (int i = 0; i < m; i++) {
    g = false;
    for (int j = p[i].first.first; j < p[i].first.second; j++) {
      if (p[i].second && a[j] > a[j + 1]) {
        f = true;
        break;
      } else if (!p[i].second && a[j] > a[j + 1]) {
        g = true;
        break;
      }
    }
    if ((f && p[i].second) || (!g && !p[i].second)) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (int i = 1; i <= n; i++) {
    cout << a[i] + 1000 << " ";
  }
  cout << '\n';
}