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

using namespace std;

fstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m;
vector<vector<int>> nodes;
vector<int> indg;
queue<int> q;

void read_data(){
    fin >> n >> m;

    nodes.resize(n + 1);
    indg.resize(n + 1);

    int x, y;

    for(int i = 1; i <= m ; i++){
        fin >> x >> y;
        nodes[x].push_back(y);
        indg[y]++;
    }

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

}

void topsort(){
    while(!q.empty()){
        int curr = q.front();
        q.pop();
        fout << curr << " ";

        for(auto& neigh : nodes[curr]){
            indg[neigh]--;
            if(indg[neigh] == 0)
                q.push(neigh);
        }
    }
}

int main(){
    read_data();
    topsort();
    return 0;
}