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

using namespace std;

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

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

    for (auto y : adj[x]) {
        if (!viz[y]) {
            dfs(y);
        }
    }

    st.push(x);
}

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

    int n, m;
    cin >> n >> m;

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

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

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