#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 10);
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
bool isPrime(long long N) {
  for (long long i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
long long cbrt(long long x) {
  long long lo = 1, hi = min(2000000ll, x);
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    if (mid * mid * mid < x) {
      lo = mid;
    } else
      hi = mid;
  }
  if (hi * hi * hi <= x)
    return hi;
  else
    return lo;
}
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
const long long nax = (long long)(100000 + 10);
vector<string> v;
vector<long long> adj[200005], vec, nod, ans1, ans2;
stack<long long> st;
long long n, m, d, k, l = 0, r, mid, s = 0, a, b, q, t, flag = 1, bad = 0,
                      c = 0;
vector<vector<long long>> arr(200005, vector<long long>(3, 0));
long long vis[200005], par[200005], col[200005];
priority_queue<pair<long long, long long>, vector<pair<long long, long long>>,
               greater<pair<long long, long long>>>
    pq;
map<long long, map<long long, long long>> ab;
void bfs(long long u) {
  vis[u] = 1;
  col[u] = 1;
  queue<long long> q;
  q.push(u);
  while (!q.empty()) {
    long long u = q.front();
    q.pop();
    for (auto &i : adj[u]) {
      if (col[i] && col[u] == col[i]) {
        flag = false;
      }
    }
    for (auto &i : adj[u]) {
      if (!vis[i]) {
        col[i] = col[u] % 2 + 1;
        vis[i] = 1;
        q.push(i);
      }
    }
  }
}
signed main() {
  cin >> n >> m;
  for (long long i = 0; i < m; i++) {
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  for (long long i = 1; i <= n; i++) {
    if (!vis[i] && adj[i].size() != 0) {
      bfs(i);
    }
  }
  for (long long i = 1; i <= n; i++) {
    if (col[i] == 1) {
      ans1.push_back(i);
    } else if (col[i] == 2) {
      ans2.push_back(i);
    }
  }
  if (!flag) {
    cout << -1 << "\n";
    return 0;
  }
  cout << ans1.size() << "\n";
  for (long long x : ans1) {
    cout << x << " ";
  }
  cout << "\n";
  cout << ans2.size() << "\n";
  for (long long x : ans2) {
    cout << x << " ";
  }
}
