#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

vector<int> graf[50001];
int degree[50001];

int main()
{
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    int n, m;
    fin>>n>>m;
    for(int i = 1; i <= m; i++)
    {   int x;
        int y;
        
        fin>>x>>y;
        graf[x].push_back(y);
        degree[y]++;
    }
    
    // Kahn's algorithm (BFS)
    queue<int> queue;
    for(int i = 1; i <= n; i++){
        if (degree[i] == 0) {
            queue.push(i);
        }
    }
            
    while (queue.size() != 0)
    {
        int node = queue.front(); // retain the node before popping it from the queue
        queue.pop();
        fout<<node<<' ';
        for(int neighbour: graf[node])
        {
            degree[neighbour]--;
            if(degree[neighbour] == 0)
                queue.push(neighbour);
        }
    }

    return 0;
}