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

using namespace std;

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

int n, m, x, y;
vector<int> G[50005];
stack<int> ans;
bool v[50005];

void dfs(int nod) {
    v[nod] = true;
    for(auto i : G[nod]) {
        if(!v[i]) {
            dfs(i);
        }
    }
    ans.push(nod);
}

void sortareTopologica() {
    for(int i = 1; i <= n; i++) {
        if(!v[i]) {
            dfs(i);
        }
    }
}

int main() {
    fin >> n >> m;
    while(m > 0) {
        fin >> x >> y;
        G[x].push_back(y);
        m--;
    }
    fin.close();
    sortareTopologica();
    while(!ans.empty()) {
        fout << ans.top() << " ";
        ans.pop();
    }
    fout.close();
    return 0;
}