#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    T t = bigmod(p, e / 2, M);
    return (t * t) % M;
  }
  return (bigmod(p, e - 1, M) * p) % M;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T multimod(T a, T b, T m) {
  T ans = 0ll;
  a %= m, b %= m;
  while (b) {
    if (b & 1ll) ans = m - ans > a ? (ans + a) : (ans + a - m);
    b >>= 1ll;
    a = (m - a) > a ? a + a : a + a - m;
  }
  return (T)ans;
}
vector<int> V[(100000 + 7)];
bool vis[(100000 + 7)];
int col[(100000 + 7)];
void DFS(int u, int c) {
  assert(c < 3);
  if (vis[u]) {
    return;
  }
  col[u] = c;
  vis[u] = 1;
  int sz = V[u].size();
  for (int i = 0; i < sz; i++) DFS(V[u][i], c % 2 + 1);
  return;
}
int fst[(100000 + 7)];
int snd[(100000 + 7)];
pair<int, int> take[(100000 + 7)];
int main() {
  int i, j, k, K;
  int x, n, m, u, v;
  cin >> n >> m;
  int tmp = -1;
  for (i = 0; i < m; i++) {
    cin >> u >> v;
    take[i] = make_pair(u, v);
    V[u].push_back(v);
    V[v].push_back(u);
    tmp = v;
  }
  for (i = 1; i <= n; i++)
    if (!vis[i]) DFS(i, 1);
  int ind = 0, idx = 0;
  for (i = 1; i <= n; i++) {
    if (col[i] == 1)
      fst[idx++] = i;
    else if (col[i] == 2)
      snd[ind++] = i;
  }
  for (i = 0; i < m; i++) {
    if (col[take[i].first] == col[take[i].second]) {
      cout << -1 << endl;
      return 0;
    }
    if (!col[take[i].first] || !col[take[i].second]) {
      cout << -1 << endl;
      return 0;
    }
  }
  assert(ind || idx);
  cout << idx << endl;
  for (i = 0; i < idx; i++) cout << fst[i] << " ";
  cout << endl;
  cout << ind << endl;
  for (i = 0; i < ind; i++) cout << snd[i] << " ";
  cout << endl;
  return 0;
}
