#include<fstream>
#include<vector>
#define maxn 50002

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector<int>a[maxn];

int grade[maxn],i,j,n,m,x,y,been[maxn],coada[maxn];

void go(int x)
{
    been[x]=1;
    for(int i=0;i<grade[x];++i)
        if(been[a[x][i]]==0)
            go(a[x][i]);
    coada[++y]=x;
}

int main()
{
    f>>n>>m;
    for(i=1;i<=m;++i)
    {
        f>>x>>y;
        a[x].push_back(y);
        ++grade[x];
    }

    y=0;

    for(i=1;i<=n;++i)
        if(!been[i])
            go(i);

    for(i=n;i;--i)
        g<<coada[i]<<" ";

    g<<"\n";
    f.close();
    g.close();

    return 0;
}