#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

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

int n, m, x, y;
vector<int> adj[50005], ans;
bool viz[50005];

void dfs(int nod){
    viz[nod]=1;
    for(auto it:adj[nod]){
        if(!viz[it]){
            dfs(it);
        }
    }
    ans.push_back(nod);
}

int main(){
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        adj[x].push_back(y);
    }
    for(int i=1;i<=n;i++){
        if(!viz[i]){
            dfs(i);
        }
    }
    reverse(ans.begin(), ans.end());
    for(auto it:ans){
        cout<<it<<" ";
    }
}