#include <bits/stdc++.h>
struct {
  int l, r;
  int lazy_upper_bound;
  bool has_exact_value;
  int largest_exact_value;
} stree[((1 << 19) << 1)];
int b[1 + (1 << 19)];
void build(int i, int l, int r) {
  const auto root = &stree[i];
  const int lid = 2 * i + 1;
  const int rid = 2 * i + 2;
  root->l = l;
  root->r = r;
  root->lazy_upper_bound = (1000 * 1000 * 1000 + 1);
  root->has_exact_value = false;
  root->largest_exact_value = -1;
  if (l < r) {
    build(lid, l, (l + r) / 2);
    build(rid, (l + r) / 2 + 1, r);
  }
}
void build2(int i) {
  const auto root = &stree[i];
  const int lid = 2 * i + 1;
  const int rid = 2 * i + 2;
  const auto left = &stree[lid];
  const auto right = &stree[rid];
  if (root->l < root->r) {
    build2(lid);
    build2(rid);
    root->largest_exact_value =
        std::max(left->largest_exact_value, right->largest_exact_value);
  } else {
    root->largest_exact_value = b[root->l];
  }
}
int rmq(int i, int l, int r) {
  const auto root = &stree[i];
  const int lid = 2 * i + 1;
  const int rid = 2 * i + 2;
  const auto left = &stree[lid];
  const auto right = &stree[rid];
  assert(l <= root->r && root->l <= r);
  if (l <= root->l && root->r <= r) {
    return root->largest_exact_value;
  } else {
    assert(root->l < root->r);
    int max = -1;
    if (l <= left->r) {
      max = std::max(max, rmq(lid, l, r));
    }
    if (right->l <= r) {
      max = std::max(max, rmq(rid, l, r));
    }
    return max;
  }
}
void propagate(int i) {
  const auto root = &stree[i];
  const int lid = 2 * i + 1;
  const int rid = 2 * i + 2;
  const auto left = &stree[lid];
  const auto right = &stree[rid];
  if (root->l < root->r && root->lazy_upper_bound != (1000 * 1000 * 1000 + 1)) {
    for (int k = 0; k <= 1; k++) {
      const auto child = ((k == 0) ? left : right);
      if (!child->has_exact_value) {
        child->lazy_upper_bound =
            std::min(child->lazy_upper_bound, root->lazy_upper_bound);
      }
    }
    root->lazy_upper_bound = (1000 * 1000 * 1000 + 1);
  }
}
void set_exact_value(int i, int k, int d) {
  const auto root = &stree[i];
  const int lid = 2 * i + 1;
  const int rid = 2 * i + 2;
  const auto left = &stree[lid];
  const auto right = &stree[rid];
  assert(root->l <= k && k <= root->r);
  if (root->l == root->r) {
    root->has_exact_value = true;
    root->largest_exact_value = d;
  } else {
    propagate(i);
    if (k <= left->r) {
      set_exact_value(lid, k, d);
    } else {
      set_exact_value(rid, k, d);
    }
    root->largest_exact_value =
        std::max(left->largest_exact_value, right->largest_exact_value);
  }
}
bool assert_upper_bound(int i, int l, int r, int u) {
  const auto root = &stree[i];
  const int lid = 2 * i + 1;
  const int rid = 2 * i + 2;
  const auto left = &stree[lid];
  const auto right = &stree[rid];
  assert(root->l == root->r ||
         root->largest_exact_value ==
             std::max(left->largest_exact_value, right->largest_exact_value));
  assert(l <= root->r && root->l <= r);
  bool okay;
  if (l <= root->l && root->r <= r) {
    if (!root->has_exact_value) {
      root->lazy_upper_bound = std::min(root->lazy_upper_bound, u);
    }
    okay = (root->largest_exact_value <= u);
  } else {
    assert(root->l < root->r);
    propagate(i);
    okay = true;
    if (l <= left->r) {
      okay &= assert_upper_bound(lid, l, r, u);
    }
    if (right->l <= r) {
      okay &= assert_upper_bound(rid, l, r, u);
    }
  }
  return okay;
}
void extract_trial_sequence(int i, int* b) {
  const auto root = &stree[i];
  const int lid = 2 * i + 1;
  const int rid = 2 * i + 2;
  if (root->l == root->r) {
    b[root->l] = root->lazy_upper_bound;
  } else {
    propagate(i);
    extract_trial_sequence(lid, b);
    extract_trial_sequence(rid, b);
  }
}
int msb(int x) {
  int m;
  for (m = 0; (1 << (m + 1)) <= x; m++)
    ;
  return m;
}
int main(void) {
  int n, m;
  scanf("%d %d", &n, &m);
  build(0, 1, n);
  bool okay = true;
  while (m--) {
    int t;
    scanf("%d", &t);
    if (t == 1) {
      int l, r, u;
      scanf("%d %d %d", &l, &r, &u);
      okay &= assert_upper_bound(0, l, r, u);
    } else {
      int k, d;
      scanf("%d %d", &k, &d);
      set_exact_value(0, k, d);
    }
  }
  if (!okay) {
    puts("NO");
  } else {
    extract_trial_sequence(0, b);
    for (int i = 1; i <= n; i++) {
      fprintf(stderr, "%d%c", b[i], (i == n) ? '\n' : ' ');
    }
    build2(0);
    rewind(stdin);
    scanf("%*d %d", &m);
    while (m--) {
      int t;
      scanf("%d", &t);
      if (t == 1) {
        int l, r, u;
        scanf("%d %d %d", &l, &r, &u);
        if (rmq(0, l, r) != u) {
          okay = false;
          break;
        }
      } else {
        int k, d;
        scanf("%d %d", &k, &d);
        set_exact_value(0, k, d);
      }
    }
    if (!okay) {
      puts("NO");
    } else {
      int or_thus = 0;
      std::set<int> seen;
      std::set<std::pair<int, int>> options;
      for (int i = 1; i <= n; i++) {
        if ((b[i] >= (1000 * 1000 * 1000 + 1) || seen.count(b[i]) == 1) &&
            b[i] != 0) {
          options.insert(std::make_pair(std::min(b[i], 1000000000), i));
          b[i] = 0;
        } else {
          or_thus |= b[i];
          seen.insert(b[i]);
        }
      }
      for (int i = 1; i <= n; i++) {
        fprintf(stderr, "%d%c", b[i], (i == n) ? '\n' : ' ');
      }
      while (!options.empty()) {
        auto option = *options.begin();
        options.erase(options.begin());
        int m = msb(option.first);
        int x;
        if (or_thus & (1 << m)) {
          x = (1 << m) - 1;
        } else {
          x = (1 << m);
          if (option.first > x) {
            options.insert(
                std::make_pair(option.first ^ (1 << m), option.second));
          }
        }
        b[option.second] |= x;
        or_thus |= x;
      }
      puts("YES");
      for (int i = 1; i <= n; i++) {
        fprintf(stdout, "%d%c", b[i], (i == n) ? '\n' : ' ');
      }
    }
  }
  return 0;
}
