#include <bits/stdc++.h>

using namespace std;

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

const int DIM = 5e4 + 1;

vector <int> adj[DIM];
bitset <DIM> vis;

vector <int> st;

void dfs(int nod)
{
	vis[nod] = true;
	
	for(auto i : adj[nod])
		if(!vis[i])
		{
			dfs(i);
		}
	
	st.emplace_back(nod);
}

main()
{
	int n, m;
	fin >> n >> m;
	
	for(; m; --m)
	{
		int x, y;
		fin >> x >> y;
		
		adj[x].emplace_back(y);
	}
	
	for(int i = 1; i <= n; i++)
		if(!vis[i])
		{
			dfs(i);
		}
	
	reverse(st.begin(), st.end());
	
	for(auto i : st)
		fout << i << ' ';
}