#include <bits/stdc++.h>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int sorted[50001],n,m,x,y,i,j,viz[50001],l;
vector<int> v[50001];

void dfs(int i)
{
    viz[i]=1;
    for (auto x : v[i])
        if (viz[x]==0)
        dfs(x);
    sorted[++l]=i;
}

int main()
{
    fin>>n>>m;
    for (i=1;i<=m;i++)
        {
            fin>>x>>y;
            v[x].push_back(y);
        }
    for (i=1;i<=n;i++)
        if (viz[i]==0)
        dfs(i);
    for (i=n;i>=1;i--)
        fout<<sorted[i]<<" ";
    return 0;
}