#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 998244353;
long long mpow(long long a, long long b) {
  if (b >= (MOD - 1)) b %= (MOD - 1);
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2);
  t1 *= t1;
  t1 %= MOD;
  if (b % 2) t1 *= a;
  t1 %= MOD;
  return t1;
}
long long mpow(long long a, long long b, long long p) {
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2, p);
  t1 *= t1;
  t1 %= p;
  if (b % 2) t1 *= a;
  t1 %= p;
  return t1;
}
long long modinverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long range(long long l, long long r) { return l + rand() % (r - l + 1); }
int main() {
  long long n, m;
  cin >> n >> m;
  vector<vector<long long>> al(n);
  for (long long i = 0; i < m; i++) {
    long long a, b;
    cin >> a >> b;
    a--;
    b--;
    al[a].push_back(b);
    al[b].push_back(a);
  }
  if (n <= 1 || m >= (n * (n - 1) / 2))
    cout << "NO" << endl;
  else {
    long long l = -1, r = -1;
    for (int i = 0; i < n; i++) {
      if (al[i].size() < n - 1) {
        l = i;
        vector<bool> v(n, false);
        v[i] = true;
        for (int j = 0; j < al[i].size(); j++) {
          v[al[i][j]] = true;
        }
        for (int j = 0; j < n; j++) {
          if (!v[j]) {
            r = j;
            break;
          }
        }
        break;
      }
    }
    vector<int> ans1(n);
    vector<int> ans2(n);
    ans1[l] = 1;
    ans1[r] = 2;
    ans2[l] = 1;
    ans2[r] = 1;
    int ci = 3;
    for (int i = 0; i < n; i++) {
      if (i != l && i != r) ans1[i] = ci, ans2[i] = ci, ci++;
    }
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) cout << ans1[i] << " ";
    cout << endl;
    for (int i = 0; i < n; i++) cout << ans2[i] << " ";
    cout << endl;
  }
}
