#include <fstream>
#include <stack>
#include <vector>
#define NMAX 50001

using namespace std;

int n, m;
vector <int> adj[NMAX];
bool viz[NMAX];
stack <int> st;

void dfs(int node) {
    viz[node] = 1;

    for (auto neigh : adj[node]) {
        if (!viz[neigh]) {
            dfs(neigh);
        }
    }

    st.push(node);
}

int main() {
    ifstream cin ("sortaret.in");
    ofstream cout ("sortaret.out");

    cin >> n >> m;
    
    for (int i = 1, x, y; i <= m; i++) {
        cin >> x >> y;
        adj[x].push_back(y);
    }

    for (int node = 1; node <= n; n++) {
        if (!viz[node]) {
            dfs(node);
        }
    }

    while (!st.empty()) {
        cout << st.top() << " ";
        st.pop();
    }
    
    return 0;
}