#include <iostream>
#include <vector>
#include <stack>
using namespace std;
const int NMAX = 1e5 + 5;
stack<int> S;
vector<int> adj[NMAX];
bool vis[NMAX];
void dfs(int nod)
{
	vis[nod] = 1;
	for(auto &it : adj[nod])
	{
		if(!vis[it]) dfs(it);
	}
	S.push(nod);
}
int main()
{
	(void)! freopen("sortaret.in", "r", stdin);
	(void)! freopen("sortaret.out", "w", stdout);
	int n, m, x, y; cin >> n >> m;
	while(m--)
	{
		cin >> x >> y;
		adj[x].push_back(y);
	}
	for(int i = 1; i <= n; ++i)
		if(!vis[i]) dfs(i);
	while(!S.empty())
	{
		cout << S.top() << ' ';
		S.pop();
	}
	return 0;
}