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 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;
}