#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
#define pb(x) push_back(x)

int oo[50005];
vector<int>vv[50005];
bool ww[50005];
int n,m;

void dfs(int x){
	ww[x]=1;
	int l=vv[x].size();
	for(int i=0;i<l;i++)
		if(!ww[vv[x][i]]) dfs(vv[x][i]);
	oo[++oo[0]]=x;
}

int main(){
	int x,y;
	
	f >> n >> m;
	for(int i=0;i<m;i++)
	{
		f >> x >> y;
		vv[x].pb(y);
	}
	
	for(int i=1;i<=n;i++)
		if(!ww[i]) dfs(i);
		
	for(int i=n;i>0;i--) g << oo[i] << " ";
		
	return 0;
}