#include <bits/stdc++.h>
using namespace std;
int dir1[8][2] = {1, 2, 2, 1, 2, -1, 1, -2, -1, 2, -2, 1, -1, -2, -2, -1};
int dir2[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
int dir3[8][2] = {1, 0, 0, 1, -1, 0, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};
int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
bool Isleap(int year) {
  if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0) return true;
  return false;
}
bool isPrime(int x) {
  if (x == 1)
    return false;
  else if (x == 2)
    return true;
  for (int i = 2; i <= sqrt(x * 1.0); ++i) {
    if (x % i == 0) return false;
  }
  return true;
}
vector<int> vt;
int main() {
  int n, k, a, b, c, d;
  while (~scanf("%d %d %d %d %d %d", &n, &k, &a, &b, &c, &d)) {
    vt.clear();
    if (n == 4 || k < n + 1) {
      printf("-1\n");
      continue;
    }
    for (int i = 1; i <= n; ++i) {
      if (i != a && i != b && i != c && i != d) vt.push_back(i);
    }
    printf("%d %d", a, c);
    for (int i = 0; i < vt.size(); ++i) printf(" %d", vt[i]);
    printf(" %d %d\n", d, b);
    printf("%d %d", c, a);
    for (int i = 0; i < vt.size(); ++i) printf(" %d", vt[i]);
    printf(" %d %d\n", b, d);
  }
  return 0;
}
