#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long power(long long x, long long y) {
  if (y == 0) return 1;
  if (y == 1) return x;
  if (y % 2)
    return x * power(x, y / 2) * power(x, y / 2);
  else
    return power(x, y / 2) * power(x, y / 2);
}
void solve() {
  long long n, m, x, y;
  cin >> n >> m;
  long long a[n + 1], b[n + 1];
  map<pair<long long, long long>, long long> f;
  for (long long i = 0; i < m; i++) {
    cin >> x >> y;
    long long mn = min(x, y), mx = max(x, y);
    f[make_pair(mn, mx)] = 1;
  }
  long long in1 = 0, in2 = 0, flag = 0;
  for (long long i = 1; i <= n; i++) {
    for (long long j = i + 1; j <= n; j++) {
      if (!f[make_pair(i, j)]) {
        in1 = i;
        in2 = j;
        flag = 1;
        break;
      }
    }
    if (flag) break;
  }
  if (flag == 0) {
    cout << "NO\n";
    return;
  }
  long long k = 3;
  for (long long i = 1; i <= n; i++) {
    if (i != in1 && i != in2) {
      a[i] = k;
      b[i] = k;
      k++;
    } else if (i == in1) {
      a[i] = 1;
      b[i] = 1;
    } else {
      a[i] = 2;
      b[i] = 1;
    }
  }
  cout << "YES\n";
  for (long long i = 1; i <= n; i++) cout << a[i] << " ";
  cout << "\n";
  for (long long i = 1; i <= n; i++) cout << b[i] << " ";
  cout << "\n";
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
