A. NP-HARD PROBLEM

#include<bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int,int> pii;
typedef vector< pii > vii;

#define ll          long long
#define ff          first
#define ss          second
#define pb          push_back
#define mkp         make_pair
#define sz          size()

#define forf(a,b,c)    for(int i=a;i<=b;i+=c)
#define forr(a,b,c)    for(int i=a;i>=b;i-=c)
#define all(a)      a.begin(),a.end()
#define mem(a,b)    memset(a,b,sizeof(a))
#define pi          2*acos(0.0)
#define End         return 0;

#define scan1(a)    scanf("%d",&a)
#define scan2(a,b)  scanf("%d %d",&a,&b)
#define scan3(a,b,c)  scanf("%d %d %d",&a,&b,&c)
#define scanl(a)    scanf("%lld",&a)
#define scanll(a,b) scanf("%lld %lld",&a,&b)
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)

#define print1(a)    printf("%d",a)
#define print2(a,b)  printf("%d %d",a,b)
#define print3(a,b,c)  printf("%d %d %d",a,b,c)
#define printl(a)    printf("%lld",a)
#define printll(a,b) printf("%lld %lld",a,b)
#define printlll(a,b,c) printf("%lld %lld %lld",a,b,c)

#define MAXN        100000007
#define INF 0x3f3f3f3f
//int mark[10007];vi prime;void seive(){for(int i=2;i<10000;i++){if(mark[i]==0){prime.pb(i);for(int j=i+i;j<=10000;j+=i)mark[j]=1;}}}

//freopen("input.txt", "r", stdin);
vi adj[100005],res[10];
int mark[100005];
int color[100005];

bool bfs(int n)
{
    mark[n]=1;
    color[n]=0;
    res[0].pb(n);
    queue<int>q;
    q.push(n);
    while(!q.empty())
    {
        int node=q.front();
        q.pop();
        for(int i=0;i<adj[node].sz;i++)
        {
            if(mark[adj[node][i]]==1)
            {
                if(color[adj[node][i]]==color[node])
                {
                    //cout<<"working"<<endl;
                    return false;
                }
            }
                else{
                    mark[adj[node][i]]=1;
                    if(color[node]==0)
                        color[adj[node][i]]=1,res[1].pb(adj[node][i]);
                    else color[adj[node][i]]=0,res[0].pb(adj[node][i]);

                    q.push(adj[node][i]);
                }
        }
    }
    return true;
}
int main()
{
   ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        int a,b;
        cin>>a>>b;
        adj[a].pb(b);
        adj[b].pb(a);
    }


    for(int i=1;i<=n;i++)
    {
        if(mark[i]==0&&adj[i].sz>0)
        {
            if(bfs(i))
                {
                    for(int j=0;j<2;j++)
                    {
                        cout<<res[j].sz<<endl;
                        for(int u: res[j])
                            cout<<u<<" ";
                        cout<<endl;
                    }
                    return 0;
                }
                else{
                    cout<<-1<<endl;
                    return 0;
                }
        }
    }
}