#include <bits/stdc++.h>

using namespace std;

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

int n, m, k, x, y, st[50100]; bool viz[50100];
vector <int> v[50100];

void dfs(int x){
	viz[x] = 1;
	for(auto it : v[x]) 
		if(!viz[it]) dfs[it];
	st[++k] = x;
}

int main(){
	in >> n >> m;
	for(int i = 1; i <= m; i++){
		in >> x >> y;
		v[x].push_back(y);
	}
	for(int i = 1; i <= n; i++) 
		if(!viz[i]) dfs(i);
	for(int i = 1; i <= k; i++) out << st[i] << ' ';
	return 0;
}