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

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m,x,y;
vector<int> inDegree;
vector<vector<int>> adj;

void sortTop(){
    queue<int> q;
    
    for(int i=1; i<=n; i++){
        if(inDegree[i] == 0){
            q.push(i);
        }
    }
    while(!q.empty()){
        int nod = q.front();
        q.pop();

        g << nod << " ";

        for(auto& neigh: adj[nod]){
            inDegree[neigh]--;

            if(inDegree[neigh] == 0){
                q.push(neigh);
            }
        }
    }
}

int main(){
    f >> n >> m;
    adj.resize(n+1);
    inDegree.resize(n+1, 0);
    for(int i=1; i<=m; i++){
        f >> x >> y;
        adj[x].push_back(y);
        inDegree[y]++;
    }
    sortTop();


    return 0;
}