#include<stdio.h>
#include<vector>
#include<deque>
#define N 50001
using namespace std;
vector<int> v[N];
deque<int>Q;
int n,i,L,g[N];
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	int x,y;
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d%d",&n,&i);
	for(;i;i--){scanf("%d%d",&x,&y);g[y]++;v[x].push_back(y);}
	for(i=1;i<=n;i++)if(!g[i])Q.push_back(i);
}
void solve()
{
	for(;Q.size();)
	{
	    i=Q.front();Q.pop_front();
	    printf("%d ",i);
	    for(vector<int>::iterator it=v[i].begin();it!=v[i].end();it++)
	    {
	        g[*it]--;
	        if(!g[*it])Q.push_back(*it);
	    }
	}
}