#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
const int mod = 1e9 + 7;
const int maxn = 1010;
int n, k;
int a, b, c, d;
int path[maxn];
int main() {
  cin >> n >> k;
  cin >> a >> b >> c >> d;
  if (k < n + 1 || n == 4) {
    puts("-1");
  } else {
    int x = 1;
    for (int i = 1; i <= n; i++) {
      if (i != a && i != b && i != c && i != d) {
        x = i;
        break;
      }
    }
    cout << a << " " << c << " " << x << " " << d << " ";
    int p = 0;
    for (int i = 1; i <= n; i++) {
      if (i == a || i == b || i == c || i == d || i == x) {
        continue;
      }
      cout << i << " ";
      path[++p] = i;
      if (p == n - 5) break;
    }
    cout << b << endl;
    cout << c << " " << a << " " << x << " " << b << " ";
    for (int i = p; i >= 1; i--) cout << path[i] << " ";
    cout << d << endl;
  }
}
