#include <iostream>
#include <fstream>
#include <vector>

using namespace std; 

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

vector <int> G[50005];
vector <bool> viz;
vector <int> stiva;

void dfs(int nod)
{int i;
for(i=0;i<G[nod].size();i++)
	if(viz[G[nod][i]]==0)
	{
		viz[G[nod][i]]=1;
		dfs(G[nod][i]);
	}
stiva.push_back(nod);
}

int main()
{int i,x,y, n,m;

f>>n>>m;
viz.assign(n+1, false);
for(i=1;i<=m;i++)
{
	f>>x>>y;
	G[x].push_back(y);
}

for(i=1;i<=n;i++)
	if(viz[i]==0)
		dfs(i);
	
while(stiva.empty()==0)
{
	g<<stiva.back()<<' ';
	stiva.pop_back();
}
return 0;}