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

int n,m;
vector<vector<int>> adj(50001);
vector<int> incomingEdges(50001);
vector<int> sorted;
queue<int> q;

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);
        incomingEdges[dest]++;
    }

    for(int i=1; i<=n; i++)
        if(incomingEdges[i]==0)
            q.push(i);

    while(!q.empty()) {
        int current=q.front();
        q.pop();
        sorted.push_back(current);
        for(auto next:adj[current])
            if(--incomingEdges[next]==0)
                q.push(next);
    }

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

    return 0;
}