#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
vector <int> grafinv[50003];
vector < pair <int,int> > muchii;
queue <int> chestie;
int grad[50003],n,m,sortat[50003],cnt,var;
void sortare ()
{
	for(int i=1;i<=n;++i)
		if(grad[i]==0)
			chestie.push(i);
	while(chestie.size()!=0)
	{
		var=chestie.front();
		for(int i=0;i<(int)grafinv[var].size();++i)
		{
			grad[grafinv[var][i]]--;
			if(grad[grafinv[var][i]]==0)
				chestie.push(grafinv[var][i]);
		}
		sortat[cnt]=var;cnt--;
		chestie.pop();
	}
}
int main ()
{
	int nr1,nr2;
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d%d", &n, &m);
	for(int i=1;i<=m;++i)
	{
		scanf("%d%d", &nr1, &nr2);
		muchii.push_back(make_pair(nr1,nr2));
	}
	sort(muchii.begin(),muchii.end());
	grafinv[muchii[0].second].push_back(muchii[0].first);grad[muchii[0].first]++;
	for(int i=1;i<(int)muchii.size();++i)
		if(muchii[i].first!=muchii[i-1].first || muchii[i].second!=muchii[i-1].second)
			grafinv[muchii[i].second].push_back(muchii[i].first),grad[muchii[i].first]++;
	cnt=n;
	sortare();
	for(int i=1;i<=n;++i)
		printf("%d ", sortat[i]);
	return 0;
}