#include <bits/stdc++.h>
using namespace std;
int n, k, a, b, c, d, now, f[1001];
bool jud[1001];
int main() {
  cin.sync_with_stdio(false);
  cin >> n >> k;
  cin >> a >> b >> c >> d;
  if (k < n + 1 || n == 4) {
    cout << -1 << endl;
    return 0;
  }
  f[1] = a;
  f[2] = c;
  f[n - 1] = d;
  f[n] = b;
  jud[a] = jud[b] = jud[c] = jud[d] = true;
  int now = 1;
  for (int i = 3; i <= n - 2; i++) {
    while (jud[now]) now++;
    f[i] = now;
    now++;
  }
  for (int i = 1; i <= n - 1; i++) cout << f[i] << " ";
  cout << f[n] << endl;
  cout << f[2] << " " << f[1] << " ";
  for (int i = 3; i <= n - 2; i++) cout << f[i] << " ";
  cout << f[n] << " " << f[n - 1];
}
