#include <fstream>
#include <vector>
#include <queue>
#include <bitset>

using namespace std;

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

const int maxn = 50005;

queue <int> q;
vector <int> g[maxn];
vector <int> discovered;
int n, m;
bitset <maxn> used;

inline void dfs(int node) {
	used[node] = 1;
	for(vector <int> :: iterator it = g[node].begin() ; it != g[node].end() ; ++ it)
		if(!used[*it])
			dfs(*it);
	discovered.push_back(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(!used[i])
			dfs(i);
	for(vector <int> :: reverse_iterator it = discovered.rbegin() ; it != discovered.rend() ; ++ it)
		fout << *it << ' ';
}