#include <bits/stdc++.h>
using namespace std;
long long int max(long long int a, long long int b) {
  if (a > b)
    return a;
  else
    return b;
}
long long int min(long long int a, long long int b) {
  if (a < b)
    return a;
  else
    return b;
}
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
int XX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int YY[] = {-1, 0, 1, -1, 1, -1, 0, 1};
vector<long long int> vec[100005];
bool visited[100005];
long long int arr[100005];
long long int val = 1;
void dfs(long long int node) {
  for (auto itr : vec[node]) {
    if (!visited[itr]) {
      visited[itr] = true;
      arr[itr] = val;
      val++;
      dfs(itr);
    }
  }
}
vector<long long int> ans;
int main() {
  memset(visited, false, sizeof(visited));
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int a, b, p, i, j, x, y, k, u, v, n, r1, r2, m;
  cin >> n >> m;
  for (i = 0; i < m; i++) {
    cin >> u >> v;
    vec[u].push_back(v);
    vec[v].push_back(u);
  }
  if (n == 1) {
    cout << "NO";
    return 0;
  }
  long long int z = (n * (n - 1)) / 2;
  if (m >= z) {
    cout << "NO";
    return 0;
  }
  vector<long long int> vec2;
  for (i = 1; i <= n; i++) {
    if (!visited[i]) {
      visited[i] = true;
      vec2.push_back(i);
      arr[i] = val;
      val++;
      dfs(i);
    }
  }
  cout << "YES"
       << "\n";
  if (vec2.size() > 1) {
    for (i = 1; i <= n; i++) {
      cout << arr[i] << " ";
    }
    cout << "\n";
    long long int node = vec2[1];
    arr[node] = 1;
    for (i = 1; i <= n; i++) {
      cout << arr[i] << " ";
    }
    return 0;
  }
  memset(visited, false, sizeof(visited));
  queue<long long int> q;
  long long int node1, node2;
  for (i = 1; i <= n; i++) {
    if (vec[i].size() < n - 1) {
      set<long long int> s;
      for (auto itr : vec[i]) s.insert(itr);
      node1 = i;
      for (j = 1; j <= n; j++) {
        if (j == i) continue;
        if (s.find(j) == s.end()) {
          node2 = j;
          break;
        }
      }
      break;
    }
  }
  val = 3;
  arr[node1] = 1;
  arr[node2] = 2;
  for (j = 1; j <= n; j++) {
    if (j != node1 && j != node2) {
      arr[j] = val;
      val++;
    }
  }
  for (i = 1; i <= n; i++) {
    cout << arr[i] << " ";
  }
  cout << "\n";
  arr[node2] = 1;
  for (i = 1; i <= n; i++) {
    cout << arr[i] << " ";
  }
}
