#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int n, m;
vector <vector <int>> g(3e5);
vector <bool> be(3e5, false);
vector <bool> ki(3e5, false);
vector <int> t;

void dfs(int a) {
	if (be[a] && !ki[a]) { cout << 0; exit(0); }
	if (be[a]) return;
	be[a] = true;
	for (int b : g[a]) dfs(b);
	ki[a] = true;
	t.push_back(a);
}

bool edge(int a, int b) {
	for (int x : g[a]) if (x == b) return true;
	return false;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m;
	int a, b;
	for (int i = 0; i < m; i++) {
		cin >> a >> b;
		g[a].push_back(b);
	}

	for (int i = 1; i <= n; i++) dfs(i);
	reverse(t.begin(), t.end());

	a = -1;
	for (int i = 0; i < n - 1; i++) if (!edge(t[i], t[i + 1])) a = i;

	cout << (a > -1 ? 2 : 1) << "\n";
	for (int x : t) cout << x << " ";
	if (a == -1) return 0;
	swap(t[a], t[a + 1]);
	cout << "\n";
	for (int x : t) cout << x << " ";
}