#include <bits/stdc++.h>
using namespace std;
long long mod_v(long long num) {
  if (num >= 0)
    return (num % 1000000007);
  else
    return (num % 1000000007 + 1000000007) % 1000000007;
}
long long bigmod(long long b, long long p, long long m) {
  long long res = 1 % m, x = b % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
int main() {
  int n, k, a, b, c, d;
  scanf("%d %d", &n, &k);
  scanf("%d %d %d %d", &a, &b, &c, &d);
  if (n == 4) {
    printf("-1\n");
    return 0;
  }
  if (k <= n) {
    printf("-1\n");
    return 0;
  }
  printf("%d %d", a, c);
  for (int i = 1; i <= n; i++) {
    if (i == a || i == b || i == c || i == d) continue;
    printf(" %d", i);
  }
  printf(" %d %d\n", d, b);
  printf("%d %d", c, a);
  for (int i = 1; i <= n; i++) {
    if (i == a || i == b || i == c || i == d) continue;
    printf(" %d", i);
  }
  printf(" %d %d\n", b, d);
  return 0;
}
