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

int n, m;
vector<vector<int>> adj(50001);
vector<int> visited(50001);
list<int> toposort;

void dfs(int node) {
    visited[node]=1;
    for(auto i:adj[node])
        if(visited[i] == 0)
            dfs(i);
    toposort.push_front(node);
}

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

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

    for(int i = 1; i <= n; ++i)
        if(visited[i] == 0)
            dfs(i);

    for(auto i:toposort)
        fout<< i <<" ";

    return 0;
}