#include<cstdio>
#include<vector>
#include<deque>
using namespace std;
vector<int> v[100010],Q;
void read(),solve(),df(int);
int N,M,i,x,y,viz[50010];
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d%d",&N,&M);
	for(;M;M--)
	{
		scanf("%d%d",&x,&y);
		v[x].push_back(y);
	}
}
void solve()
{
	for(i=1;i<=N;i++)
		if(!viz[i])df(i);
	vector<int>::reverse_iterator it1;
	for(it1=Q.rbegin();it1!=Q.rend();it1++)
		printf("%d ",*it1);
	printf("\n");
}
void df(int X)
{
	viz[X]=1;
	vector<int>::iterator it;
	for(it=v[X].begin();it!=v[X].end();it++)
		if(!viz[*it])df(*it);
	Q.push_back(X);
}