#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int v[N];
int main() {
  int n, k;
  int a, b, c, d;
  scanf("%d%d", &n, &k);
  scanf("%d%d%d%d", &a, &b, &c, &d);
  if (k < n + 1) return 0 * puts("-1");
  v[1] = a;
  v[2] = c;
  v[n - 1] = d;
  v[n] = b;
  int t = 2;
  for (int i = (1); i < (n + 1); ++i) {
    if (i == a || i == b || i == c || i == d) continue;
    v[++t] = i;
  }
  if (v[3] == b || v[n - 2] == c) return 0 * puts("-1");
  for (int i = (1); i < (n + 1); ++i) printf("%d%c", v[i], i == n ? '\n' : ' ');
  printf("%d %d ", c, a);
  for (int i = (3); i < (n - 1); ++i) printf("%d ", v[i]);
  printf("%d %d\n", b, d);
  return 0;
}
