#include<fstream>
#include<vector>
using namespace std;

int n,m;
vector<int> g[50005], sol;
bool viz[50005];

bool dfs(int nod) {
  
  viz[nod]=1;
  
  for (int i=0; i<g[nod].size(); ++i)
   if (viz[g[nod][i]]==0) dfs(g[nod][i]);
   
  sol.push_back(nod);	
	
}

int main(void) {
    ifstream cin("sortaret.in");
	ofstream cout("sortaret.out");
	
	cin>>n>>m;
	
	for (int i=1; i<=m; ++i) {
	   int x,y;
	   cin>>x>>y;
	   
	   g[x].push_back(y);	
	}
	
    for (int i=1; i<=n; ++i) 
	 if (viz[i]==0) dfs(i);
	 
	for (int i=n; i>=1; --i) cout<<sol[i-1]<<" ";	
		
	
	return 0;
}