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;
bool comp(pair<int, int> a, pair<int, int> b) {
  if (a.first != b.first)
    return a.first < b.first;
  else
    return a.second < b.second;
}
int main() {
  ios_base ::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  vector<int> ans(n + 1);
  vector<pair<int, int> > arr1;
  vector<pair<int, int> > arr2;
  for (int i = 0; i < m; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    if (x == 1)
      arr1.push_back({y, z});
    else
      arr2.push_back({y, z});
  }
  sort(arr1.begin(), arr1.end(), comp);
  vector<pair<int, int> > arr;
  if (arr1.size() != 0) arr.push_back(arr1[0]);
  for (int i = 1; i < arr1.size(); i++) {
    if (arr1[i].first > arr.back().second)
      arr.push_back(arr1[i]);
    else
      arr.back().second = max(arr.back().second, arr1[i].second);
  }
  for (int i = 0; i <= n; i++) ans[i] = n - i + 1;
  for (int i = 0; i < arr.size(); i++) {
    sort(ans.begin() + arr[i].first, ans.begin() + arr[i].second + 1);
  }
  int flag = 1;
  for (int i = 0; i < arr2.size(); i++) {
    int flag1 = 0;
    for (int j = arr2[i].first; j < arr2[i].second; j++) {
      if (ans[j] > ans[j + 1]) {
        flag1 = 1;
        break;
      }
    }
    if (flag1 == 0) {
      flag = 0;
      break;
    }
  }
  if (flag) {
    cout << "YES"
         << "\n";
    for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  } else
    cout << "NO"
         << "\n";
}