#include <fstream>
#include <vector>
#include <stack>
#include <bitset>
#define N 50005

using namespace std;
vector < int > adjacents[N];
stack < int > st;
bitset < N > visited;
int n, m;

void Read() {
    ifstream fin("sortaret.in");
    int x, y;
    fin >> n >> m;
    for(int i = 0; i < m; i++) {
        fin >> x >> y;
        adjacents[x].push_back(y);
    }
    fin.close();
}

void topSort(int v) {
    visited[v] = 1;
    for(auto it : adjacents[v])
        if(!visited[it])
            topSort(it);
    st.push(v);
}

void Solve() {
    ofstream fout("sortaret.out");
    for(int i = 1; i <= n; ++i)
        visited[i] = 0;
    for(int i = 1; i <= n; ++i)
        if(!visited[i])
            topSort(i);
    while(!st.empty()) {
        fout << st.top() << " ";
        st.pop();
    }
    fout.close();
}

int main() {
    Read();
    Solve();
    return 0;
}