#include <fstream>
#include <queue>
#include <vector>

std::ifstream in("sortaret.in");
std::ofstream out("sortaret.out");

int n, m;
std::vector<int> vecini[50000];
bool verificat[50000];
int list[50000];
int l = 0;

void dfs(int nod) {
    for (int vecin : vecini[nod]) {
        if (!verificat[vecin]) {
            verificat[vecin] = true;
            dfs(vecin);
        }
    }

    list[l++] = nod;
}

int main() {
    in >> n >> m;

    for (int i = 0; i < m; i++) {
        int x, y;
        in >> x >> y;
        vecini[x].push_back(y);
    }

    for (int i = 1; i <= n && l != n; i++) {
        if (!verificat[i]) {
            verificat[i] = true;
            dfs(i);
        }
    }

    for (int i = l - 1; i >= 0; i--) {
        out << list[i] << ' ';
    }
}