// UUID: 79230575-b428-4003-bd07-ff5339f42904
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;
	cin>>n>>k;
	vector<vector<int>>v(n+1);
	vector<int>be(n+1, 0);
	for(int i=1; i<=k; i++){
		int a, b;
		cin>>a>>b;
		v[a].push_back(b);
		be[b]++;
	}
	queue<int>s;
	int w=-1;
	for(int i=1; i<=n; i++) if(be[i]==0)s.push(i);
	vector<int>m;
	while(!s.empty()){
		int c=s.front();
		s.pop();
		m.push_back(c);
		if(!s.empty()) w=m.size()-1;
		for(int x : v[c]){
			be[x]--;
			if(be[x]==0) s.push(x);
		}
	}
	if(m.size()!=n) cout<<0<<endl;
	else if(w==-1){
		cout<<1<<endl;
		for(int x : m) cout<<x<<" ";
	}
	else{
		cout<<2<<endl;
		for(int x : m) cout<<x<<" ";
		cout<<endl;
		for(int i=0; i<n; i++){
			if(i==w) cout<<m[i+1];
			else if(i==(w+1)) cout<<m[i-1];
			else cout<<m[i];
			cout<<" ";
		}
	}
	
}