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

int n,m;
vector<vector<int>> adj(50001);
vector<bool> visited(50001);
vector<bool> hasIncomingEdges(50001);
stack<int> st;
vector<int> sorted;

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

    fin>>n>>m;
    for(int i=1; i<=m; i++) {
        int from,to;
        fin>>from>>to;
        adj[from].push_back(to);
        hasIncomingEdges[to]=1;
    }

    for(int i=1; i<=n; i++)
        if(!hasIncomingEdges[i])
            st.push(i);

    while(!st.empty()) {
        int current=st.top();
        sorted.push_back(current);
        st.pop();

        visited[current]=1;
        for(auto next:adj[current])
            if(not visited[next])
                st.push(next);
    }

    for(auto it:sorted)
        fout<<it<<' ';

    return 0;
}