#include <fstream>
#include <vector>

using namespace std;

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

const int nmax= 50000;

vector <int> v[nmax+1];

int k, q[nmax+1];
bool u[nmax+1];

void dfs( int p ) {
    u[p]= 1;
    for ( int i= (int)v[p].size()-1; i>=0; --i ) {
        if ( u[v[p][i]]==0 ) {
            dfs(v[p][i]);
        }
    }
    ++k;
    q[k]= p;
}

int main(  ) {
    int n, m;
    fin>>n>>m;
    for ( int i= 1; i<=m; ++i ) {
        int x, y;
        fin>>x>>y;
        v[x].push_back(y);
    }

    for ( int i= 1; i<=n; ++i ) {
        if ( u[i]==0 ) {
            dfs(i);
        }
    }

    for ( int i= n; i>=1; --i ) {
        fout<<q[i]<<" ";
    }
    fout<<"\n";

    return 0;
}