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

using namespace std;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

vector <vector<int>> graph;
vector <int> grad;
queue <int> q;

int main()
{
    int n, m;
    cin >> n >> m;
    graph.resize(n + 5);
    grad.resize(n + 5);
    for(int i = 0; i < m; i++){
        int x, y;
        cin >> x >> y;
        graph[x].push_back(y);
        grad[y]++;
    }
    for(int i = 1; i <= n; i++)
        if(!grad[i])
            q.push(i);
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        cout << nod << ' ';
        for(auto vecin:graph[nod]){
            grad[vecin]--;
            if(grad[vecin] == 0)
                q.push(vecin);
        }
    }
    return 0;
}