#include<fstream>
#include<vector>
#include<stack>
using namespace std;

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

int n, m;
vector <int> nod[100010];
stack <int> s;
bool viz[100010];

void dfs(int n){
    viz[n] = true;
    for(int i = 0; i<nod[n].size(); ++i){
        int x = nod[n][i];
        if(!viz[x]){
                dfs(x);
        }
    }
    s.push(n);
}




int main(){
    cin>>n>>m;
    while(m--){
        int x,y;
        cin>>x>>y;
        nod[x].push_back(y);
    }


    for(int i = 1; i<=n; ++i){
        if(!viz[i]) dfs(i);
    }

    while(!s.empty()){
        cout<<s.top()<<' ';
        s.pop();
    }




    return 0;
}