#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

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

vector<vector<int>> la;
vector<int> viz;
stack<int> sortareTop;

void dfsSortTop(int x) {
    viz[x] = 1;
    for (auto& y : la[x]) {
        if (viz[y] == 0) {
            viz[y] = 1;
            dfsSortTop(y);
        }
    }
    sortareTop.push(x);
}

int main() {
    int N, M;

    fin >> N >> M;

    la.resize(N + 1);
    viz.assign(N + 1, 0);

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

        la[x].push_back(y);
    }

    for (int i = 1; i <= N; i++) {
        if (viz[i] == 0){
            dfsSortTop(i);
        }
    }

    while(!sortareTop.empty()) {
        fout << sortareTop.top() << ' ';
        sortareTop.pop();
    }
    return 0;
}