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

using namespace std;

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

vector <vector <int> > v(50001);
vector <bool> viz(100001, false);
vector <int> d;

int dfs(int nod) {
    viz[nod] = true;

    for (auto vecin : v[nod])
        if (!viz[vecin]) {
            dfs(vecin);
            d.push_back(vecin);
        }
}

int main() {
    int n, m;
    int a, b;

    in >> n >> m;
    for (int i = 0; i < m; i++) {
        in >> a >> b;
        v[a].push_back(b);
    }

    for (int i = 1; i < n + 1; i++) {
        if (!viz[i]) {
            dfs(i);
            d.push_back(i);
        }
    }

    for (vector <int>::reverse_iterator it = d.rbegin(); it != d.rend(); it++)
        out << *it << ' ';

    return 0;
}