#include <cstdio>
#include <vector>

using namespace std;

#define file_in "sortaret.in"
#define file_out "sortaret.out"

#define nmax 501001

int n,m,i,a,b;
vector<int> G[nmax];
int viz[nmax];
int sol[nmax];

void dfs(int nod){
	
	if (viz[nod])
		
		return ;
	
	viz[nod]=1;
	
	vector<int> :: iterator it;
	
	for (it=G[nod].begin();it!=G[nod].end();++it)
		 dfs(*it);
	
	sol[++sol[0]]=nod;
}



int main(){
	
	freopen(file_in,"r",stdin);
	freopen(file_out,"w",stdout);
	
	scanf("%d %d", &n, &m);
	
	while(m--){
		
		scanf("%d %d", &a, &b);
		
		G[a].push_back(b);
	}
	
	for (i=1;i<=n;++i)
		 if (!viz[i])
			 dfs(i);
	
	for (i=sol[0];i>=1;--i)
          printf("%d ", sol[i]);

	return 0;
	
}