// UUID: c59c9af4-b9f8-44d9-a935-2d06db4fc20f
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define pii  pair<int, int>
#define pb push_back
#define srt(x) x.begin(),x.end()
const int INF = 1e9;

vector<vector<int>>g;
vector<int>vis;
vector<int>top;

void dfs(int v)
{
    vis[v] = 1;
    for(int u : g[v])
    {
        if(vis[u] == 1)
        {
            cout << 0;
            exit(0);
        }
        if(vis[u] == 0) dfs(u);
    }
    vis[v] = 2;
    top.pb(v);
}

signed main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
	int n, k; cin >> n >> k;
    g.resize(n);
    vis.resize(n, 0);
    while(k--)
    {
        int a, b; cin >> a >> b;
        g[--a].pb(--b);
    }
    for(int i = 0; i < n; i++) if(vis[i] == 0) dfs(i);
    reverse(srt(top));
    bool x = 0;
    for(int i = 0; i < n-1; i++)
    {
        x = 0;
        for(int u : g[top[i]])
        {
            if(u == top[i+1]) x = 1;
        }
        if(!x)
        {
            cout << 2 << "\n";
            break;
        }
        if(i == n-2) cout << 1 << "\n";
    }
    for(int u : top) cout << u+1 << " ";
    cout << "\n";
    if(!x)
    {
        for(int i = 0; i < n; i++)
        {
            if(x) cout << top[i]+1 << " ";
            else
            {
                if(i < n-1)
                {
                    x = 1;
                    for(int u : g[top[i]])
                    {
                        if(u == top[i+1]) x = 0;
                    }
                    if(x)
                    {
                        swap(top[i], top[i+1]);
                    }
                }
                cout << top[i]+1 << " ";
            }
        }
    }
}