#include<bits/stdc++.h>

using namespace std;

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

int n , m;

int main(){
    fin >> n >> m;
    vector<vector<int>> graf(n + 1);
    vector<int> gradint(n + 1 , 0);
    for(int i = 1 ; i <= m ; i++){
        int x , y; fin >> x >> y;
        graf[x].push_back(y);
        gradint[y]++;
    }
    queue<int> Q;
    for(int i = 1; i <= n ; i++){
        if(gradint[i] == 0) Q.push(i);
    }
    vector<int> rez;
    while(!Q.empty()){
        int nod = Q.front();
        Q.pop();
        rez.push_back(nod);
        for(int vecin : graf[nod]){
            gradint[vecin]--;
            if(gradint[vecin] == 0){
                Q.push(vecin);
            }
        }
    }
    for(auto i : rez) fout << i <<" ";
    return 0;
}