#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("dezbateri.in");
ofstream fout("dezbateri.out");
int n,m,i,x,y,ajung[100001],sortat[100001],k,c[100001],OK,j;
bool viz[100001];
vector <int> v[100001];
void dfs(int x)
{
	int i;
	for(i=0;i<v[x].size();i++)
	{
		ajung[v[x][i]]--;
		if(!ajung[v[x][i]])
		{
			sortat[++k]=i;
			ajung[i]=-1;
			dfs(i);
		}
	}
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        ajung[y]++;
    }
    k=0;
    OK=1;
    while(OK)
    {
    	OK=0;
    	for(i=1;i<=n;i++)
		{
			if(ajung[i]==0)
			{
				OK=1;
				sortat[++k]=i;
				ajung[i]=-1;
				dfs(i);
			}
		}
    }
    for(i=1;i<=n;i++)
    fout<<sortat[i]<<" ";
    return 0;
}