#include <bits/stdc++.h>
using namespace std;
vector<long long int> adj[1000];
void solve() {
  long long int n, k, a, b, c, d, p, cnt, id;
  cin >> n >> k >> a >> b >> c >> d;
  if (k < (n + 1)) {
    cout << -1;
    return;
  }
  vector<long long int> p1, p2;
  p1.push_back(a);
  p1.push_back(c);
  k--;
  for (long long int i = 1; i < n + 1; i++) {
    if (i == a || i == c || i == b || (p1.size() == 2 && i == d)) continue;
    p1.push_back(i);
    if (i == d) id = p1.size() - 1;
    k--;
  }
  if (p1.back() != c && p1.size() == (n - 2)) {
    p1.push_back(d);
    k--;
    id = p1.size() - 1;
  }
  p1.push_back(b);
  k--;
  if (p1.size() != n || k < 0) {
    cout << -1;
    return;
  }
  for (long long int i = 0; i < p1.size(); i++) cout << p1[i] << " ";
  cout << endl;
  cout << c << " " << a << " ";
  for (long long int i = 2; i < id; i++) {
    cout << p1[i] << " ";
  }
  for (long long int i = n - 1; i >= id; i--) cout << p1[i] << " ";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
