#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long int mul(long long int a, long long int b) {
  return ((a % mod) * (b % mod)) % mod;
}
long long int add(long long int a, long long int b) {
  return ((a % mod) + (b % mod)) % mod;
}
long long int sub(long long int a, long long int b) {
  return ((a % mod) - (b % mod) + mod) % mod;
}
long long int po(long long int a, long long int b) {
  if (b == 0) {
    return 1;
  }
  long long int t = po(a, b / 2);
  if (b % 2) {
    return mul(t, mul(t, a));
  } else {
    return mul(t, t);
  }
}
set<long long int> v[100005];
long long int a[100005];
long long int b[100005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, m;
  cin >> n >> m;
  while (m--) {
    long long int x, y;
    cin >> x >> y;
    v[x].insert(y);
    v[y].insert(x);
  }
  for (long long int i = 1; i <= n; i++) {
    if (v[i].size() != n - 1) {
      long long int j = 1;
      for (; j <= n; j++) {
        if (j == i) {
          continue;
        }
        auto it = v[i].find(j);
        if (it == v[i].end()) {
          break;
        }
      }
      cout << "YES\n";
      long long int u = 1;
      for (long long int k = 1; k <= n; k++) {
        if (k != i && k != j) {
          a[k] = u;
          b[k] = u;
          u++;
        }
      }
      a[i] = u;
      b[i] = u;
      b[j] = u;
      u++;
      a[j] = u;
      for (long long int k = 1; k <= n; k++) {
        cout << a[k] << " ";
      }
      cout << "\n";
      for (long long int k = 1; k <= n; k++) {
        cout << b[k] << " ";
      }
      exit(0);
    }
  }
  cout << "NO\n";
  return 0;
}
