#include <fstream>
#include <vector>

#define MAXN 50005

using namespace std;

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

vector <int> graph[MAXN];
int N, M, viz[MAXN], postorder[MAXN], nn;

inline void Read() {
    int x, y;

    fin >> N >> M;

    for (int i = 1; i <= M; i++) {
        fin >> x >> y;

        graph[x].push_back(y);
       // tr[y].push_back(x);
    }
}

inline void DFS(int node) {
    viz[node] = 1;

    for (auto x : graph[node]) {
        if (!viz[x])
            DFS(x);
    }
    postorder[++nn] = node;
}

inline void Solve() {
    for (int i = 1; i <= N; i++) {
        if (!viz[i])
            DFS(i);
    }
}

inline void Write() {
    for (int i = N; i; i--) {
        fout << postorder[i] << " ";
    }
}

int main () {
    Read();
    Solve();
    Write();

    fin.close(); fout.close(); return 0;
}