#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

struct _nod{
    int tata, timp, index;
};

bool cmp(_nod nod1, _nod nod2){
    return (nod1.timp<nod2.timp);
}

int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    int i, j, n, m, a, b;
    _nod nod[5000]={0};
    f>>n>>m;
    for(i=1;i<=m;i++){

        f>>a>>b;
        nod[b].tata=a;
        nod[b].timp=nod[a].timp+1;
    }
    for(i=1;i<=n;i++)
        nod[i].index=i;
    sort(nod+1, nod+1+n, cmp);
    for(i=1;i<=n;i++)
        g<<nod[i].index<<" ";

}