// UUID: ca3285d3-37c6-4f83-b061-8e0c9458068c
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <queue>
#include <vector>
using namespace std;

//A maximális int az 2^31-1 ami nagyobb mint 10^9 de kisseb mint 10^10

int main() {
int n, t;
    cin >> n >> t;

    vector<vector<int>> fa(n);
    vector<int> sz(n, 0);

    for (int i = 0; i < t; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        fa[a].push_back(b);
        sz[b]++;
    }

    queue<int> q;
    for (int i = 0; i < n; i++) {
        if (sz[i] == 0) q.push(i);
    }

    vector<int> lista;
    int count = 0;

    int where = 0;

    while (!q.empty()) {
        // if (q.size() > 1) count++; 
        if (q.size() > 1) { count = 1; where = lista.size(); }

        int u = q.front();
        q.pop();
        lista.push_back(u);

        for (int v : fa[u]) {
            sz[v]--;
            if (sz[v] == 0) q.push(v);
        }
    }

    if ((int)lista.size() != n) {
        cout << 0;
        return 0;
    }

    cout << count+1 << "\n";
    for (int x : lista) cout << x + 1 << " ";
    cout << "\n";

    if (count == 1) {
        swap(lista[where], lista[where + 1]);
        for (int x : lista) cout << x + 1 << " ";
        cout << "\n";
    }
}