#include <fstream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int NMAX=50000;
int pred[NMAX+5],sol[NMAX+5];
vector<int>succ[NMAX+5];
queue<int>q;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int main()
{
	int n,m,i,u,v,k=0,j;
	in>>n>>m;
	for(i=1;i<=m;i++)
	{
		in>>u>>v;
		pred[v]++;
		succ[u].push_back(v);
	}
	for(i=1;i<=n;i++)
	{
		if(pred[i]==0)
			q.push(i);
	}
	while(!q.empty())
	{
		u=q.front();
		q.pop();	
		for(j=0;j<(int)succ[u].size();j++)
		{
			v=succ[u][j];
			pred[v]--;
			if(pred[v]==0)
				{
					q.push(v);
				}
		}
		sol[++k]=u;	
	}
	for(i=1;i<=k;i++)
		out<<sol[i]<<'\n';
    return 0;
}