#include <bits/stdc++.h>
using namespace std;
int flag[1003], ans[1003];
int main() {
  int n, k, a, b, c, d;
  scanf("%d%d%d%d%d%d", &n, &k, &a, &b, &c, &d);
  if (k < n + 1 || n == 4) {
    printf("-1\n");
    return 0;
  }
  flag[a] = flag[b] = flag[c] = flag[d] = 1;
  ans[0] = a;
  ans[1] = c;
  ans[n - 2] = d;
  ans[n - 1] = b;
  int res = 2;
  for (int i = 1; i <= n; i++) {
    if (!flag[i]) {
      flag[i] = 1;
      ans[res++] = i;
    }
  }
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
  printf("\n");
  swap(ans[0], ans[1]);
  swap(ans[n - 1], ans[n - 2]);
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
  return 0;
}
