#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
const double EPS = 1e-9;
const double PI = acos(-1.);
const int INF = 1e9;
const int MAXN = 2e5 + 5;
const long long MOD = 1e9 + 7;
void output_path(int n, int a, int b, int c, int d) {
  cout << a << " " << c << " ";
  for (int i = (1); i <= (int)(n); i++) {
    if (i != a && i != b && i != c && i != d) {
      cout << i << " ";
    }
  }
  cout << d << " " << b << endl;
}
void solve() {
  int n, k, a, b, c, d;
  cin >> n >> k >> a >> b >> c >> d;
  if (n == 4 || k <= n) {
    cout << -1 << endl;
    return;
  }
  output_path(n, a, b, c, d);
  output_path(n, c, d, a, b);
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
}
