#include <bits/stdc++.h>
using namespace std;
const int N=105; 
queue<int> q;
vector<int> e[N];
int rudu[N];
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	while(true){
		int u,v;
		scanf("%d%d",&u,&v); 
		if(u==0&&v==0) break;
		e[u].push_back(v);
		rudu[v]++;
	}
	for(int i=1;i<=n;i++){
		if(!rudu[i]) q.push(i);
	}
	while(!q.empty()){
		int k=q.front();
		q.pop();
		cout<<k<<" "; 
		for(int j=0;j<e[k].size();j++){
			int v=e[k][j];
			rudu[v]--;
			if(!rudu[v]){
				q.push(v);
			}
		}
	}
	cout<<endl;
	return 0;
}