#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
vector<int> v[50001];
priority_queue<pair<int,int > > pq;
int i,j,n,m,k,x,y,vc[50001],vec[50001];
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);
    vc[y]++;
	}
for(i=1;i<=n;i++)
	pq.push(make_pair(-vc[i],i));
while(!pq.empty())
	{
	x=-pq.top().first;
	y=pq.top().second;
    if(vec[y]==0)
		{
		printf("%d ",y);
		vec[y]=-1;
		pq.pop();
        for(i=0;i<v[y].size();i++)
			{
			vc[v[y][i]]--;
            pq.push(make_pair(-vc[v[y][i]],v[y][i]));
			}
		}
	else
		pq.pop();
	}
return 0;
}