#include<fstream>
#include<vector>
#define MAXN 100000
#define pb push_back
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int V,E;
vector<int> G[MAXN];
vector<int> Sort;
int viz[MAXN];
void DFS(int nod){
    viz[nod]=1;
    for(int i=0;i<G[nod].size();i++){
        if(!viz[G[nod][i]])
            DFS(G[nod][i]);
    }
    Sort.pb(nod);
}
int main(){
    int a,b,i,j;
    cin>>V>>E;
    for(i=1;i<=E;i++){
        cin>>a>>b;
        G[a].pb(b);
    }
    for(i=1;i<=V;i++){
        if(!viz[i])
            DFS(i);
    }
    for(i=Sort.size()-1;i>=0;i--){
        cout<<Sort[i]<<" ";
    }
    return 0;
}