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

int n,m,a,b,i,state[50005];
vector<int> v[50005];
vector<int> S;

void read(),solve(),dfs(int x),show();

int main()
{
	read();
	solve();
	show();
	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",&a,&b);
		v[a].push_back(b);
	}
}

void solve()
{
	for(i=1;i<=n;i++)
		if(state[i]==0)
			dfs(i);
}
void dfs(int x)
{
	vector<int>::iterator it;
	state[x]=1;
	for(it=v[x].begin();it!=v[x].end();it++)
		if(state[*it]==0)
			dfs(*it);
	S.push_back(x);
}

void show()
{
	vector<int>::reverse_iterator it;
	for(it=S.rbegin();it!=S.rend();it++)
		printf("%d ",*it);
}