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

const int N=50006;
int n,m,i,j,xx,yy,t[N];
vector<int> derp[N];
queue<int> sol;

void bfs()
{
	int x,y;
	while(!sol.empty())
	{
		x = sol.front();
		sol.pop();
		printf("%d ",x);
		for(size_t i=0 ; i<derp[x].size() ; i++)
		{
			y = derp[x][i];
			t[y]--;
			if(t[y]==0)
				sol.push(y);
		}
	}
}

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",&xx,&yy);
		derp[xx].push_back(yy);
		t[yy]++;
	}
	for(i=1;i<=n;i++)
		if(!t[i])
			sol.push(i);
	bfs();
	return 0;
}