#include <fstream>
#include <vector>
#include <stack>
using namespace std;

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

vector<vector<int>> la;
stack<int> st;
vector<bool> visited;

void dfs(int s, int n) {
    visited[s] = true;
    for(int neighbour : la[s]) {
        if(!visited[neighbour]) {
            dfs(neighbour, s);
        }
    }
    st.push(s);
}

void sortare_topologica(int n) {
    for(int i = 1; i <= n; i++)
        if(visited[i] == 0) {
            dfs(i, n);
        }
    
    while(!st.empty()) {
        int curr = st.top();
        cout << curr << ' ';
        st.pop();
    }
}

int main() {
    int n, m, x, y;
    cin >> n >> m;
    la.assign(n + 1, {});
    visited.assign(n + 1, 0);
    for(int i = 0; i < m; i++)
    {
        cin >> x >> y;
        la[x].push_back(y);
    }

    sortare_topologica(n);
    return 0;
}