#include<fstream>
#include<vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int k,sortat[100001],n,i,x,y,ajung[100001],viz[100001],m,start,final;
vector <int> v[50001];
void dfs(int x)
{
    viz[x]=1;
    for(int i=0;i<v[x].size();i++)
        if(!viz[v[x][i]] && v[x][i]>0)
		{
			int z=v[x][i];
			viz[z]=1;
			v[x][i]=-100;
			ajung[i]--;
			if(!ajung[v[x][i]])
				sortat[++final]=v[x][i];
            dfs(z);
		}
    sortat[++k]=x;
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        ajung[y]++;
    }
    k=0;
    for(i=1;i<=n;i++)
        if(!ajung[i])
        {
            viz[i]=1;
			sortat[++final]=i;
        }
	start=1;
	while(start<=final || final!=n)
	{
		dfs(start);
		start++;
	}
    for(i=n;i>0;i--)
        fout<<sortat[i]<<" ";
    return 0;
}