#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-5;
const int oo = 0x3f3f3f3f;
template <class T>
inline void checkmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
  if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline T lowbit(T n) {
  return (n ^ (n - 1)) & n;
}
template <class T>
inline int countbit(T n) {
  return (n == 0) ? 0 : (1 + countbit(n & (n - 1)));
}
template <class T>
inline T gcd(T a, T b) {
  T c;
  while (a != 0) {
    c = a;
    a = b % a;
    b = c;
  }
  return b;
}
template <class T>
inline T mabs(T a) {
  if (a < 0)
    return -a;
  else
    return a;
}
typedef vector<int> VI;
typedef vector<VI> VII;
typedef vector<string> VS;
#pragma comment(linker, "/STACK:36777216")
int TEST_TO;
int TEST_FROM;
inline int solve(int testnum) {
  int n, k, a, b, c, d;
  scanf("%d%d%d%d%d%d", &n, &k, &a, &b, &c, &d);
  if (n == 4 || k <= n) {
    printf("-1\n");
    return 0;
  }
  printf("%d %d ", a, c);
  for (int i = (1); i < int(n + 1); i++)
    if (i != a && i != b && i != c && i != d) printf("%d ", i);
  printf("%d %d\n", d, b);
  printf("%d %d ", c, a);
  for (int i = (1); i < int(n + 1); i++)
    if (i != a && i != b && i != c && i != d) printf("%d ", i);
  printf("%d %d\n", b, d);
  return 0;
}
int main(int argc, char *argv[]) {
  ios::sync_with_stdio(false);
  int t = 1;
  if (argc > 1) t = atoi(argv[1]);
  TEST_FROM = 1;
  TEST_TO = t;
  for (int _t = (1); _t < int(t + 1); _t++) {
    int ret = solve(_t);
    if (ret == -1) break;
  }
  return 0;
}
