#include <fstream>
#include <vector>
#include<stack>
#define pb push_back
#define sz size()
using namespace std;

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

const int NMAX = 50009;
int n, m, a[NMAX], viz[NMAX];
vector <int> L[NMAX];
stack <int> Q;

inline void read_Data() {
    f >> n >> m;
    int x, y;
    for(int i = 1; i <= m; ++i) {
        f >> x >> y;
        L[x].pb(y);
    }
}

inline void DF(int nod) {
    viz[nod] = 1;
    for(int i = 0; i < L[nod].sz; ++i)
        if(!viz[L[nod][i]]) DF(L[nod][i]);
    Q.push(nod);
}

inline void solve() {
    for(int i = 1; i <= n; ++i)
        if(!viz[i]) DF(i);
}

inline void write_Data() {
    for(; !Q.empty(); Q.pop()) g << Q.top() << ' ';
    g << '\n';
    g.close();
}

int main() {
    read_Data();
    solve();
    write_Data();

    return 0;
}