// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

vector<int> vis;

bool dfs(vector<vector<int>>& v, int node){
    vis[node]=1;
    bool jo=true;
    for(int i : v[node]){
        if(vis[i]==1)return false;
        else if(vis[i]==0){
            jo&=dfs(v,i);
        }
    }
    vis[node]=2;
    return jo;
}

int main() {
    int n,k;cin>>n>>k;
    vector<vector<int>> v(n);
    vis.resize(n);
    vector<int> befok(n);
    for(int i = 0;i<k;i++){
        int a,b;cin>>a>>b;
        v[--a].push_back(--b);
        befok[b]++;
    }
    bool jo=true;
    for(int i = 0;i<n;i++){
        if(vis[i]==0){
            if(!dfs(v,i)){
                jo=false;
                break;
            }
        }
    }
    if(jo==false){
        cout<<0<<endl;
        return 0;
    }
    vector<int> top,bf;
    bf=befok;
    queue<int> q;
    for(int i = 0;i<n;i++){
        if(befok[i]==0)q.push(i);
    }
    bool egy=true;
    while(!q.empty()){
        if(q.size()>1&&egy){
            egy=false;
            int temp=q.front();
            q.pop();
            q.push(temp);
        }
        int node=q.front();
        q.pop();
        top.push_back(node);
        for(int i : v[node]){
            befok[i]--;
            if(befok[i]==0){
                q.push(i);
            }
        }
    }
    if(egy){
        cout<<1<<endl;
        for(int i : top)cout<<i+1<<' ';
    }
    else{
        cout<<2<<endl;
        for(int i : top)cout<<i+1<<' ';
        cout<<endl;
        vector<int> top2;
        for(int i = 0;i<n;i++){
            if(bf[i]==0)q.push(i);
        }
        while(!q.empty()){
            int node=q.front();
            q.pop();
            top2.push_back(node);
            for(int i : v[node]){
                bf[i]--;
                if(bf[i]==0){
                    q.push(i);
                }
            }
        }
        for(int i : top2)cout<<i+1<<' ';
    } 
}