#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <algorithm>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n,m,c[50005],nr;
vector <int> g[100005];
bitset <100005> viz;

void dfs(int node){
	viz[node]=1;
	for(vector<int>::iterator it=g[node].begin();it!=g[node].end();++it)
		if(!viz[*it])
			dfs(*it);
	c[++nr]=node;
}
int main(){
	fin>>n>>m;
	for(int i=1;i<=m;++i){
		int x,y;
		fin>>x>>y;
		g[x].push_back(y);
	}
	for(int i=1;i<=n;++i)
		if(!viz[i])
			dfs(i);
	for(int i=nr;i>=1;--i)
		fout<<c[i]<<' ';
	return 0;
}