#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=5010;
struct node{
	int ru,value;
	vector <int> lian;
}nodes[maxn];
int n,m,tx,ty;
int dicide=0;
bool cmp(node a,node b){
	return a.ru<b.ru;
}
int main(){
	cin >> n >> m;
	for(int i=1;i<=m;i++){
		cin >> tx >> ty;
		nodes[ty].ru++;
		nodes[tx].value=tx;
		nodes[ty].value=ty;
		nodes[tx].lian.push_back(ty);
	}
	for(int i=1;i<=n;i++){
		sort(nodes+i,nodes+n+1,cmp);
		cout << nodes[i].value << endl;
		if(dicide==0)
			if(nodes[i].ru==nodes[i+1].ru){
				dicide=1;
				break;
			}
		for(int j=1;j<=nodes[i].lian.size();j++){
			nodes[j].ru--;
		}
	}
	cout << dicide;
	return 0;
}

求大佬找找错，QAQ