#include<cstdio>
#include<deque>
#include<vector>
#include<algorithm>
using namespace std;
int n,i,k,m,x,y,b;
bool viz[50005];
vector<int>v[50005];
deque<int>c;

void df(int x)
{
	int j;
	viz[x]=true;
	for (j=0;j<v[x].size();j++) if (!viz[v[x][j]]) df(v[x][j]);
	c.push_back(x);
}
int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d %d",&n,&m);
	for (i=1;i<=m;i++) scanf("%d %d ",&x,&y),v[x].push_back(y);
	for (i=1;i<=n;i++) if (!viz[i]) df(i);
	while (!c.empty()) printf("%d ",c.back()),c.pop_back();
	return 0;
}