#include <bitset>
#include <fstream>
#include <vector>
#include <unordered_map>
#include <unordered_set>

#define MAX_N 50002

using namespace std;

bitset < MAX_N > b;
vector < int > v;
unordered_map < int, unordered_set < int > > t;

void dfs(int x) {
    if(b[x]) {
        return;
    }
    b[x] = true;
    for(auto i = t[x].begin(); i != t[x].end(); i++) {
        dfs(*i);
    }
    v.push_back(x);
}

int main() {
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    int n, m; f >> n >> m;

    for(int i = 1; i <= m; i++) {
        int x, y; f >> x >> y;
        t[x].insert(y);
    }
    for(int i = 1; i <= n; i++) {
        dfs(i);
    }
    for(int i = v.size() - 1; i >= 0; i--) {
        g << v[i] << ' ';
    }
    f.close();
    g.close();
    return 0;
}