#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
const int INF = INT_MAX / 2;
const int MOD = 1e9 + 7;
const int MN = 1001;
int n, k, a, b, c, d;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> a >> b >> c >> d;
  if (n == 4)
    cout << -1 << '\n';
  else if (k < n + 1)
    cout << -1 << '\n';
  else {
    vector<int> v;
    for (int i = 1; i <= n; ++i) {
      if (i != a && i != b && i != c && i != d) v.push_back(i);
    }
    cout << a << ' ' << d << ' ';
    for (auto e : v) cout << e << ' ';
    cout << c << ' ' << b << '\n';
    cout << c << ' ' << b << ' ';
    for (int i = v.size() - 1; i >= 0; --i) cout << v[i] << ' ';
    cout << a << ' ' << d << '\n';
  }
  return 0;
}
