#include <bits/stdc++.h>
using namespace std;
long long mod(long long a, long long b) {
  if (a > b)
    return a - b;
  else
    return b - a;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n, m, la;
  cin >> n >> m;
  if (n == 1 || 2 * m >= (n * (n - 1))) {
    cout << "NO";
    return 0;
  }
  if (m == 0) {
    cout << "YES\n";
    for (long long i = 1; i <= n; i++) cout << i << " ";
    cout << endl;
    for (long long i = 1; i <= n - 1; i++) cout << i << " ";
    cout << 1;
    return 0;
  }
  long long arr[n + 5];
  memset(arr, 0, sizeof(arr));
  vector<pair<long long, long long>> vec;
  map<long long, long long> m1;
  set<long long> s2[n + 5];
  for (long long i = 0; i < m; i++) {
    long long x, y;
    cin >> x >> y;
    long long x1 = min(x, y);
    long long x2 = max(x, y);
    x = x1;
    y = x2;
    vec.push_back({x, y});
    m1[x]++;
    m1[y]++;
    s2[x].insert(y);
  }
  sort(vec.begin(), vec.end());
  for (long long i = 0; i < m; i++) {
    long long x, y;
    x = vec[i].first;
    y = vec[i].second;
    if (arr[x] < arr[y]) continue;
    if (arr[x] >= arr[y]) arr[y] = 1 + arr[x];
  }
  vector<pair<long long, long long>> vec1;
  for (long long i = 1; i <= n; i++) {
    vec1.push_back({arr[i], i});
  }
  sort(vec1.begin(), vec1.end());
  long long ind1, ind2;
  for (long long i = 1; i <= n; i++) {
    if (m1[i] != n - 1) {
      ind1 = i;
      for (long long j = i + 1; j <= n; j++) {
        if (j != i && s2[i].find(j) == s2[i].end()) {
          ind2 = j;
          break;
        }
      }
      break;
    }
  }
  long long ctr = 1;
  for (auto it : vec1) {
    arr[it.second] = ctr;
    ctr++;
  }
  vec1.clear();
  arr[ind1] = n - 1;
  arr[ind2] = n;
  for (long long i = 1; i <= n; i++) {
    if (i != ind1 && i != ind2) arr[i] -= n;
    vec1.push_back({arr[i], i});
  }
  sort(vec1.begin(), vec1.end());
  long long ans[n + 5];
  ctr = 1;
  for (auto it : vec1) {
    arr[it.second] = ctr;
    ctr++;
  }
  for (long long i = 1; i <= n; i++) {
    ans[i] = arr[i];
  }
  ans[ind2] = n;
  ans[ind1] = n;
  cout << "YES\n";
  for (long long i = 1; i <= n; i++) cout << arr[i] << " ";
  cout << endl;
  for (long long i = 1; i <= n; i++) cout << ans[i] << " ";
}
